Search results for "Applied Mathematics"

showing 10 items of 4379 documents

Two graphs with a common edge

2014

Let G = G1 ∪ G2 be the sum of two simple graphs G1,G2 having a common edge or G = G1 ∪ e1 ∪ e2 ∪ G2 be the sum of two simple disjoint graphs G1,G2 connected by two edges e1 and e2 which form a cycle C4 inside G. We give a method of computing the determinant det A(G) of the adjacency matrix of G by reducing the calculation of the determinant to certain subgraphs of G1 and G2. To show the scope and effectiveness of our method we give some examples

Discrete mathematicsBlock graphadjacency matrixcycleApplied MathematicsSymmetric graphpathComparability graphgraphdeterminant of graphlaw.inventionCombinatoricsPathwidthlawOuterplanar graphLine graphQA1-939Discrete Mathematics and CombinatoricsMathematicsMathematicsUniversal graphDistance-hereditary graphDiscussiones Mathematicae Graph Theory
researchProduct

On the cardinality of almost discretely Lindelof spaces

2016

A space is said to be almost discretely Lindelof if every discrete subset can be covered by a Lindelof subspace. Juhasz et al. (Weakly linearly Lindelof monotonically normal spaces are Lindelof, preprint, arXiv:1610.04506 ) asked whether every almost discretely Lindelof first-countable Hausdorff space has cardinality at most continuum. We prove that this is the case under $$2^{<{\mathfrak {c}}}={\mathfrak {c}}$$ (which is a consequence of Martin’s Axiom, for example) and for Urysohn spaces in ZFC, thus improving a result by Juhasz et al. (First-countable and almost discretely Lindelof $$T_3$$ spaces have cardinality at most continuum, preprint, arXiv:1612.06651 ). We conclude with a few rel…

Discrete mathematicsCardinal inequality Lindelof space Arhangel’skii Theorem elementary submodel left-separated discrete set free sequence.General Mathematics010102 general mathematicsHausdorff spaceGeneral Topology (math.GN)Mathematics::General TopologyMonotonic functionSpace (mathematics)01 natural sciences010101 applied mathematicsMathematics::LogicCardinalityLindelöf spaceFOS: MathematicsSettore MAT/03 - GeometriaContinuum (set theory)0101 mathematicsSubspace topologyAxiomMathematics - General TopologyMathematics
researchProduct

A Brauer-Wielandt formula (with an application to character tables)

2016

If a p p -group P P acts coprimely on a finite group G G , we give a Brauer-Wielandt formula to count the number of fixed points | C G ( P ) | | \textbf {C}_{G}(P) | of P P in G G . This serves to determine the number of Sylow p p -subgroups of certain finite groups from their character tables.

Discrete mathematicsCharacter tableApplied MathematicsGeneral MathematicsArithmeticMathematicsProceedings of the American Mathematical Society
researchProduct

Efficient computation of the branching structure of an algebraic curve

2012

An efficient algorithm for computing the branching structure of a compact Riemann surface defined via an algebraic curve is presented. Generators of the fundamental group of the base of the ramified covering punctured at the discriminant points of the curve are constructed via a minimal spanning tree of the discriminant points. This leads to paths of minimal length between the points, which is important for a later stage where these paths are used as integration contours to compute periods of the surface. The branching structure of the surface is obtained by analytically continuing the roots of the equation defining the algebraic curve along the constructed generators of the fundamental gro…

Discrete mathematicsCircular algebraic curveComputational Geometry (cs.CG)FOS: Computer and information sciencesStable curveApplied MathematicsButterfly curve (algebraic)010102 general mathematics010103 numerical & computational mathematics01 natural sciencesModular curveMathematics - Algebraic GeometryComputational Theory and Mathematics14Q05Algebraic surfaceFOS: MathematicsComputer Science - Computational GeometryAlgebraic functionAlgebraic curve0101 mathematicsHyperelliptic curveAlgebraic Geometry (math.AG)AnalysisMathematics
researchProduct

Fixed point theory for multivalued generalized nonexpansive mappings

2012

A very general class of multivalued generalized nonexpansive mappings is defined. We also give some fixed point results for these mappings, and finally we compare and separate this class from the other multivalued generalized nonexpansive mappings introduced in the recent literature.

Discrete mathematicsClass (set theory)Applied MathematicsDiscrete Mathematics and CombinatoricsFixed-point theoremFixed pointCoincidence pointAnalysisMathematicsApplicable Analysis and Discrete Mathematics
researchProduct

Fixed points for multivalued mappings in b-metric spaces

2015

In 2012, Samet et al. introduced the notion ofα-ψ-contractive mapping and gave sufficient conditions for the existence of fixed points for this class of mappings. The purpose of our paper is to study the existence of fixed points for multivalued mappings, under anα-ψ-contractive condition of Ćirić type, in the setting of completeb-metric spaces. An application to integral equation is given.

Discrete mathematicsClass (set theory)Article Subjectlcsh:MathematicsApplied Mathematicsalpha-admissible multivalued mapping b-metric space fixed point integral equation.Fixed pointType (model theory)lcsh:QA1-939Integral equationMetric spaceSettore MAT/03 - GeometriaAnalysisMathematics
researchProduct

Guaranteed error bounds for a class of Picard-Lindelöf iteration methods

2013

We present a new version of the Picard-Lindelof method for ordinary dif- ¨ ferential equations (ODEs) supplied with guaranteed and explicitly computable upper bounds of an approximation error. The upper bounds are based on the Ostrowski estimates and the Banach fixed point theorem for contractive operators. The estimates derived in the paper take into account interpolation and integration errors and, therefore, provide objective information on the accuracy of computed approximations. peerReviewed

Discrete mathematicsClass (set theory)Banach fixed-point theoremOdeguaranteed error boundsPicard-Lindelöf methodsinversio-ongelmatelliptic boundary value problemsPower iterationApproximation errorOrdinary differential equationComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONApplied mathematicsa posteriori estimatesObjective informationInterpolationMathematics
researchProduct

Analytic solution for a class of discrete-time Riccati equations arising in Nash games

1990

Discrete mathematicsClass (set theory)Discrete time and continuous timeApplied MathematicsRiccati equationApplied mathematicsLinear-quadratic regulatorAnalytic solutionAlgebraic Riccati equationMathematicsNash gamesApplied Mathematics Letters
researchProduct

On the existence of conditionally invariant probability measures in dynamical systems

2000

Let T : X→X be a measurable map defined on a Polish space X and let Y be a non-trivial subset of X. We give conditions ensuring the existence of conditionally invariant probability measures to non-absorption in Y. For dynamics which are non-singular with respect to some fixed probability measure we supply sufficient conditions for the existence of absolutely continuous conditionally invariant measures. These conditions are satisfied for a wide class of dynamical systems including systems that are Φ-mixing and Gibbs.

Discrete mathematicsClass (set theory)Dynamical systems theoryApplied MathematicsGeneral Physics and AstronomyStatistical and Nonlinear PhysicsAbsolute continuityRandom measurePolish spaceInvariant measureInvariant (mathematics)Mathematical PhysicsProbability measureMathematicsNonlinearity
researchProduct

Restricted 123-avoiding Baxter permutations and the Padovan numbers

2007

AbstractBaxter studied a particular class of permutations by considering fixed points of the composite of commuting functions. This class is called Baxter permutations. In this paper we investigate the number of 123-avoiding Baxter permutations of length n that also avoid (or contain a prescribed number of occurrences of) another certain pattern of length k. In several interesting cases the generating function depends only on k and is expressed via the generating function for the Padovan numbers.

Discrete mathematicsClass (set theory)Golomb–Dickman constantStirling numbers of the first kindApplied MathematicsPadovan numbersGenerating functionFixed pointCombinatoricsPermutationDiscrete Mathematics and CombinatoricsTree (set theory)Generating treesBaxter permutationsForbidden subsequencesMathematicsDiscrete Applied Mathematics
researchProduct