English
Related papers

Related papers: Topological polynomials with a simple core

200 papers

Given a rational monomial map, we consider the question of finding a toric variety on which it is algebraically stable. We give conditions for when such variety does or does not exist. We also obtain several precise estimates of the degree…

Dynamical Systems · Mathematics 2010-07-20 Jan-Li Lin

Thurston defined invariant laminations, i.e. collections of chords of the unit circle $S^1$ (called \emph{leaves}) that are pairwise disjoint inside the open unit disk and satisfy a few dynamical properties. To be directly associated to a…

Dynamical Systems · Mathematics 2016-01-18 Alexander M. Blokh , Debra Mimbs , Lex G. Oversteegen , Kirsten I. S. Valkenburg

To a univariate monic polynomial is attached a special planar forest that is called the picture of the polynomial. Isotopy classes of pictures are called signatures. All combinatorially possible signatures are realized and spaces of…

Algebraic Geometry · Mathematics 2017-02-21 Norbert A'Campo

Let $F(t,u)\equiv F(u)$ be a formal power series in $t$ with polynomial coefficients in $u$. Let $F\_1, ..., F\_k$ be $k$ formal power series in $t$, independent of $u$. Assume all these series are characterized by a polynomial equation $$…

Combinatorics · Mathematics 2008-05-05 Mireille Bousquet-Mélou , Arnaud Jehanne

The following numerical control over the topological equivalence is proved: two complex polynomials in $n\not= 3$ variables and with isolated singularities are topologically equivalent if one deforms into the other by a continuous family of…

Algebraic Geometry · Mathematics 2007-05-23 Arnaud Bodin , Mihai Tibar

Circuit topology refers to the arrangement of interactions between objects belonging to a linearly ordered object set. Linearly ordered set of objects are common in nature and occur in a wide range of applications in economics, computer…

Disordered Systems and Neural Networks · Physics 2015-09-02 Alireza Mashaghi , Abolfazl Ramezanpour

We describe the topology of singular real algebraic curves in a smooth surface. We enumerate and bound in terms of the degree the number of topological types of singular algebraic curves in the real projective plane.

Algebraic Geometry · Mathematics 2026-01-14 Christopher-Lloyd Simon

An explicit lattice point realization is provided for the primary components of an arbitrary binomial ideal in characteristic zero. This decomposition is derived from a characteristic-free combinatorial description of certain primary…

Commutative Algebra · Mathematics 2008-03-28 Alicia Dickenstein , Laura Felicia Matusevich , Ezra Miller

The coefficients of the chain polynomial of a finite poset enumerate chains in the poset by their number of elements. The chain polynomials of the partition lattices and their standard type $B$ analogues are shown to have only real roots.…

Combinatorics · Mathematics 2023-01-03 Christos A. Athanasiadis , Katerina Kalampogia-Evangelinou

We state a kind of Euclidian division theorem: given a polynomial P(x) and a divisor d of the degree of P, there exist polynomials h(x),Q(x),R(x) such that P(x) = h(Q(x)) +R(x), with deg h=d. Under some conditions h,Q,R are unique, and Q is…

Algebraic Geometry · Mathematics 2009-10-12 Arnaud Bodin

An important problem in the theory of finite dynamical systems is to link the structure of a system with its dynamics. This paper contains such a link for a family of nonlinear systems over the field with two elements. For systems that can…

Combinatorics · Mathematics 2024-11-19 Omar Colon-Reyes , Reinhard Laubenbacher , Bodo Pareigis

This is a straightforward introduction to the properties of polynomials in many variables that do not vanish in the open upper half plane. Such polynomials generalize many of the well-known properties of polynomials with all real roots.

Classical Analysis and ODEs · Mathematics 2007-11-27 Steve Fisk

A topological invariant of the geodesic laminations on a modular surface is constructed. The invariant has a continuous part (the tail of a continued fraction) and a combinatorial part (the singularity data). It is shown, that the invariant…

Geometric Topology · Mathematics 2018-11-02 Igor Nikolaev

Let T be a topology on the finite set Xn. We consider the open polynomial associated with the topology T. Its coefficients are the cardinality of open sets of size j=0,...,n. J. Brown [4] asked when this polynomial has only real zeros. We…

Combinatorics · Mathematics 2013-10-15 Moussa Benoumhani

We study a generalization of the classical correspondence between homogeneous quadratic polynomials, quadratic forms, and symmetric/alternating bilinear forms to forms in $n$ variables. The main tool is combinatorial polarization, and the…

Number Theory · Mathematics 2015-09-21 Aleš Drápal , Petr Vojtěchovský

We give a necessary and sufficient condition on a homogeneous polynomial ideal for its Taylor complex to be exact. Then we give a combinatorial construction of a minimal resolution for ideals satisfying the above condition (in particular…

Commutative Algebra · Mathematics 2007-05-23 Sergey Yuzvinsky

Cameron and Kazanidis have recently shown that rank-3 graphs are either cores or have complete cores, and they asked whether this holds for all strongly regular graphs. We prove that this is true for the point graphs and line graphs of…

Combinatorics · Mathematics 2008-06-10 Chris Godsil , Gordon F. Royle

In this paper we show that polyomino ideal of a simple polyomino coincides with the toric ideal of a weakly chordal bipartite graph and hence it has a quadratic Gr\"obner basis with respect to a suitable monomial order.

Commutative Algebra · Mathematics 2015-01-26 Ayesha Asloob Qureshi , Takafumi Shibuta , Akihiro Shikama

Planar central configurations can be seen as critical points of the reduced potential or solutions of a system of equations. By the homogeneity and invariance of the potential with respect to SO(2), it is possible to see that the…

Dynamical Systems · Mathematics 2007-05-23 Davide L. Ferrario

A polynomial is said to be unimodal if its coefficients are non-decreasing and then non-increasing. The domination polynomial of a graph $G$ is the generating function of the number of domination sets of each cardinality in $G$, and its…

Combinatorics · Mathematics 2020-12-23 Iain Beaton , Jason I. Brown
‹ Prev 1 8 9 10 Next ›