Search results for "combinatoric"

showing 10 items of 1776 documents

Matroid optimization problems with monotone monomials in the objective

2022

Abstract In this paper we investigate non-linear matroid optimization problems with polynomial objective functions where the monomials satisfy certain monotonicity properties. Indeed, we study problems where the set of non-linear monomials consists of all non-linear monomials that can be built from a given subset of the variables. Linearizing all non-linear monomials we study the respective polytope. We present a complete description of this polytope. Apart from linearization constraints one needs appropriately strengthened rank inequalities. The separation problem for these inequalities reduces to a submodular function minimization problem. These polyhedral results give rise to a new hiera…

PolynomialMonomialOptimization problemRank (linear algebra)Applied Mathematics0211 other engineering and technologies021107 urban & regional planningPolytopeMonotonic function0102 computer and information sciences02 engineering and technology01 natural sciencesMatroidCombinatoricsMonotone polygon010201 computation theory & mathematicsComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONDiscrete Mathematics and CombinatoricsMathematicsDiscrete Applied Mathematics
researchProduct

Vanishing Abelian integrals on zero-dimensional cycles

2011

In this paper we study conditions for the vanishing of Abelian integrals on families of zero-dimensional cycles. That is, for any rational function $f(z)$, characterize all rational functions $g(z)$ and zero-sum integers $\{n_i\}$ such that the function $t\mapsto\sum n_ig(z_i(t))$ vanishes identically. Here $z_i(t)$ are continuously depending roots of $f(z)-t$. We introduce a notion of (un)balanced cycles. Our main result is an inductive solution of the problem of vanishing of Abelian integrals when $f,g$ are polynomials on a family of zero-dimensional cycles under the assumption that the family of cycles we consider is unbalanced as well as all the cycles encountered in the inductive proce…

PolynomialPure mathematicsGeneral MathematicsZero (complex analysis)34C07 34C08 34D15 34M35Rational functionFunction (mathematics)Dynamical Systems (math.DS)Composition (combinatorics)Moment problemAbelian integral; cycleFOS: MathematicsMathematics - Dynamical SystemsAbelian groupAbel equationMathematics
researchProduct

Locally tame plane polynomial automorphisms

2010

Abstract For automorphisms of a polynomial ring in two variables over a domain R , we show that local tameness implies global tameness provided that every 2-generated locally free R -module of rank 1 is free. We give examples illustrating this property.

PolynomialRank (linear algebra)Polynomial ringPolynomial automorphismsCommutative Algebra (math.AC)01 natural sciencesCombinatoricsMathematics - Algebraic GeometryFOS: MathematicsAlgebra en Topologie0101 mathematicsAlgebraic Geometry (math.AG)MathematicsAlgebra and TopologyAlgebra and Number TheoryPlane (geometry)local tameness010102 general mathematicsA domainMathematics - Commutative AlgebraAutomorphism[ MATH.MATH-AG ] Mathematics [math]/Algebraic Geometry [math.AG]010101 applied mathematicsComputingMethodologies_DOCUMENTANDTEXTPROCESSING[MATH.MATH-AG]Mathematics [math]/Algebraic Geometry [math.AG]14R10Journal of Pure and Applied Algebra
researchProduct

Varieties of special Jordan algebras of almost polynomial growth

2019

Abstract Let J be a special Jordan algebra and let c n ( J ) be its corresponding codimension sequence. The aim of this paper is to prove that in case J is finite dimensional, such a sequence is polynomially bounded if and only if the variety generated by J does not contain U J 2 , the special Jordan algebra of 2 × 2 upper triangular matrices. As an immediate consequence, we prove that U J 2 is the only finite dimensional special Jordan algebra that generates a variety of almost polynomial growth.

PolynomialSequenceCodimension (Mathematics)Algebra and Number TheoryJordan algebra010102 general mathematicsTriangular matrixCodimensão (Matemática)CodimensionPolynomial identity01 natural sciencesIdentidade polinomialCombinatoricsSettore MAT/02 - AlgebraPolynomial identity codimension sequence Jordan algebra almost polynomial growthIdentityBounded functionIdentidade0103 physical sciencesArtigo original010307 mathematical physics0101 mathematicsVariety (universal algebra)Mathematics
researchProduct

A Characterization of Quintic Helices

2005

A polynomial curve of degree 5, @a, is a helix if and only if both @[email protected]^'@? and @[email protected]^'@[email protected]^''@? are polynomial functions.

PolynomialTheorem of LancreteducationComputingMilieux_LEGALASPECTSOFCOMPUTINGCharacterization (mathematics)behavioral disciplines and activitiesMathematics::Algebraic TopologyCombinatoricsMathematics - Geometric TopologyTheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITYhealth services administrationComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONFOS: Mathematicshealth care economics and organizationsMathematicsPhysics::Biological PhysicsQuantitative Biology::BiomoleculesDegree (graph theory)InformationSystems_INFORMATIONSYSTEMSAPPLICATIONSApplied MathematicsMathematical analysisGeometric Topology (math.GT)Pythagorean hodograph curveshumanitiesQuintic functionComputational MathematicsGeneralized polynomial helices
researchProduct

Exact Voronoi diagram of smooth convex pseudo-circles: General predicates, and implementation for ellipses

2013

International audience; We examine the problem of computing exactly the Voronoi diagram (via the dual Delaunay graph) of a set of, possibly intersecting, smooth convex \pc in the Euclidean plane, given in parametric form. Pseudo-circles are (convex) sites, every pair of which has at most two intersecting points. The Voronoi diagram is constructed incrementally. Our first contribution is to propose robust and efficient algorithms, under the exact computation paradigm, for all required predicates, thus generalizing earlier algorithms for non-intersecting ellipses. Second, we focus on \kcn, which is the hardest predicate, and express it by a simple sparse $5\times 5$ polynomial system, which a…

Polynomialexact computationAerospace Engineering02 engineering and technologyComputer Science::Computational GeometryEllipse[INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]01 natural sciencesIncircle and excircles of a triangleCombinatoricsparametric curveTheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY0202 electrical engineering electronic engineering information engineeringPower diagramVoronoi diagramParametric equationimplementationComputingMethodologies_COMPUTERGRAPHICSMathematicsDiscrete mathematics[INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC]Regular polygon020207 software engineeringCGALComputer Graphics and Computer-Aided DesignWeighted Voronoi diagram[ INFO.INFO-SC ] Computer Science [cs]/Symbolic Computation [cs.SC]0104 chemical sciences010404 medicinal & biomolecular chemistryModeling and SimulationAutomotive Engineering[ INFO.INFO-CG ] Computer Science [cs]/Computational Geometry [cs.CG]InCircle predicateVoronoi diagram
researchProduct

The behavior of solutions of a parametric weighted (p, q)-laplacian equation

2021

<abstract><p>We study the behavior of solutions for the parametric equation</p> <p><disp-formula> <label/> <tex-math id="FE1"> \begin{document}$ -\Delta_{p}^{a_1} u(z)-\Delta_{q}^{a_2} u(z) = \lambda |u(z)|^{q-2} u(z)+f(z,u(z)) \quad \mbox{in } \Omega,\, \lambda >0, $\end{document} </tex-math></disp-formula></p> <p>under Dirichlet condition, where $ \Omega \subseteq \mathbb{R}^N $ is a bounded domain with a $ C^2 $-boundary $ \partial \Omega $, $ a_1, a_2 \in L^\infty(\Omega) $ with $ a_1(z), a_2(z) > 0 $ for a.a. $ z \in \Omega $, $ p, q \in (1, \infty) $ and $ \Delta_{p}^{a_1}, \Delta_{q}^{a_2} $ are weighted …

Positive and negative solutionsGeneral MathematicsNodal solutionsLambdaOmegaCombinatoricssymbols.namesakeMathematics - Analysis of PDEsSettore MAT/05 - Analisi MatematicaQA1-939FOS: Mathematicspositive and negative solutionsResonant Carathéodory functionudc:517.956Physics35J20 35J60Spectrum (functional analysis)weighted (pWeighted (p q)-LaplacianDifferential operatorresonant Carathéodory functionweighted (pq)-LaplacianDirichlet boundary conditionBounded functionq)-laplacianDomain (ring theory)symbolsnodal solutionsParametric power termLaplace operatorMathematicsparametric power termAnalysis of PDEs (math.AP)
researchProduct

An existence result for a Neumann problem

2015

The main result of this paper deals with the existence of at least one positive solution for a second order Neumann boundary value problem. Such a result is obtained by using an abstract coincidence point theorem that allows to get our conclusion under non standard conditions on the nonlinearity.

Positive solutionSecond-order Neumann problemApplied MathematicsAnalysiFixed pointExistence resultCoincidence pointDiscrete Mathematics and Combinatoric
researchProduct

A rank theorem for analytic maps between power series spaces

1994

Power seriesPure mathematicsGeneral MathematicsFundamental theorem of linear algebraDiscontinuous linear mapCombinatoricssymbols.namesakeFréchet spaceLagrange inversion theoremsymbolsOpen mapping theorem (functional analysis)Algebraic geometry and analytic geometryAnalytic functionMathematicsPublications mathématiques de l'IHÉS
researchProduct

On the Size Complexity of Deterministic Frequency Automata

2013

Austinat, Diekert, Hertrampf, and Petersen [2] proved that every language L that is (m,n)-recognizable by a deterministic frequency automaton such that m > n/2 can be recognized by a deterministic finite automaton as well. First, the size of deterministic frequency automata and of deterministic finite automata recognizing the same language is compared. Then approximations of a language are considered, where a language L′ is called an approximation of a language L if L′ differs from L in only a finite number of strings. We prove that if a deterministic frequency automaton has k states and (m,n)-recognizes a language L, where m > n/2, then there is a language L′ approximating L such that L′ c…

Powerset constructionPushdown automatonComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Nonlinear Sciences::Cellular Automata and Lattice GasesCombinatoricsDeterministic pushdown automatonDeterministic finite automatonDeterministic automatonComputer Science::Programming LanguagesQuantum finite automataTwo-way deterministic finite automatonNondeterministic finite automatonComputer Science::Formal Languages and Automata TheoryMathematics
researchProduct