Related papers: Combinatorial properties of Newton maps

Many (if not most) of convex polytopes, important for combinatorial and algebraic geometry, are closely related to secondary polytopes of point configurations, or base polytopes of submodular functions, or their numerous variations and…

Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces.…

Already for bivariate tropical polynomials, factorization is an NP-Complete problem. In this paper, we give an efficient algorithm for factorization and rational factorization of a rich class of tropical polynomials in $n$ variables.…

A combinatorial methods are used to investigate some properties of certain generalized Stirling numbers, including explicit formula and recurrence relations. Furthermore, an expression of these numbers with symmetric function is deduced.

Let $X$, $Y$ be sets and let $\Phi$, $\Psi$ be mappings with domains $X^{2}$ and $Y^{2}$ respectively. We say that $\Phi$ and $\Psi$ are combinatorially similar if there are bijections $f \colon \Phi(X^2) \to \Psi(Y^{2})$ and $g \colon Y…

We present a novel preconditioning technique for proximal optimization methods that relies on graph algorithms to construct effective preconditioners. Such combinatorial preconditioners arise from partitioning the graph into forests. We…

We use the characteristic polynomial of the Coxeter matrix of an algebra to complete the combinatorial classification of piecewise hereditary algebras which Happel gave in terms of the trace of the Coxeter matrix. We also give a…

This is a detailed survey -- with rigorous and self-contained proofs -- of some of the basics of elementary combinatorics and algebra, including the properties of finite sums, binomial coefficients, permutations and determinants. It is…

This is a survey on algorithmic questions about combinatorial and geometric properties of convex polytopes. We give a list of 35 problems; for each the current state of knowledege on its theoretical complexity status is reported. The…

Many combinatorial problems can be formulated as a polynomial optimization problem that can be solved by state-of-the-art methods in real algebraic geometry. In this paper we explain many important methods from real algebraic geometry, we…

We introduce generalised orbit algebras. The purpose here is to measure how some combinatorial properties can characterize the action of a group of permutations on the subsets. The similarity with orbit algebras is such that it took the…

In this paper, we first describe a matricial Newton-type algorithm designed to solve the multivariable spectrum approximation problem. We then prove its global convergence. Finally, we apply this approximation procedure to multivariate…

In this paper we give a unified proof of the fact that the Julia set of Newton's method applied to a holomorphic function of the complex plane (a polynomial of degree large than $1$ or an entire transcendental function) is connected. The…

With this work we aim to show how Mathematica can be a useful tool to investigate properties of combinatorial structures. Specifically, we will face enumeration problems on independent subsets of powers of paths and cycles, trying to…

This paper presents a program analysis method that generates program summaries involving polynomial arithmetic. Our approach builds on prior techniques that use solvable polynomial maps for summarizing loops. These techniques are able to…

We implement a novel representation of model search spaces as diagrams over a category of models, where we have restricted attention to a broad class of models whose structure is presented by \C-sets. (Co)limits in these diagram categories…

Over finite fields, if the image of a polynomial map is not the entire field, then its cardinality can be bounded above by a significantly smaller value. Earlier results bound the cardinality of the value set using the degree of the…

Suppose $f$ and $g$ are two post-critically finite polynomials of degree $d_1$ and $d_2$ respectively and suppose both of them have a finite super-attracting fixed point of degree $d_0$. We prove that one can always construct a rational map…

The motivation of this work is to define cohomology classes in the space of knots that are both easy to find and to evaluate, by reducing the problem to simple linear algebra. We achieve this goal by defining a combinatorial graded cochain…

Answering a question posed by Adam Epstein, we show that the collection of conjugacy classes of polynomials admitting a parabolic fixed point and at most one infinite critical orbit is a set of bounded height in the relevant moduli space.…