Related papers: Combinatorial properties of Newton maps
A simple construction is presented, which generalises piecewise linear one-dimensional Markov maps to an arbitrary number of dimensions. The corresponding coupled map lattice, known as a simplicial mapping in the mathematical literature,…
This paper considers a hyperplane arrangement constructed with a subset of a set of all simple paths in a graph. A connection of the constructed arrangement to the maximum matching problem is established. Moreover, the problem of finding…
From an identity connecting a combinatorial sum and Legendre polynomials, we derive closed forms for a number of combinatorial sums. Some of them are obtained via results about the integrals of functions associated with Legendre…
We give a formula for computing the characteristic polynomial for certain hyperplane arrangements in terms of the number of bipartite graphs of given rank and cardinality.
We study the postcritically-finite (PCF) maps in the moduli space of complex polynomials $\mathrm{MP}_d$. For a certain class of rational curves $C$ in $\mathrm{MP}_d$, we characterize the condition that $C$ contains infinitely many PCF…
We give a combinatorial description of shape theory using finite topological $T_0$-spaces (finite partially ordered sets). This description may lead to a sort of computational shape theory. Then we introduce the notion of core for inverse…
We provide upper bounds for the cardinality of the value set of a polynomial map in several variables over a finite field. These bounds generalize earlier bounds for univariate polynomials.
The first half of this paper is largely expository, wherein we present a systematic combinatorial approach to the theory of polynomial (semi)invariants and multilinear invariants of several vectors and covectors, for the classical groups.…
In this note a combinatorial formula related to the symmetric group is generalized to an arbitrary finite Weyl group.
We construct and study the tropical moduli space \(\mathcal{M}_3^{\mathrm{trop}}\) of degree-$3$ tropical rational maps \(\mathbb{T}\PP^1 \to \mathbb{T}\PP^1\) up to post-composition. Using a combinatorial description in terms of slope…
This is a survey on tropical polytopes from the combinatorial point of view and with a focus on algorithms. Tropical convexity is interesting because it relates a number of combinatorial concepts including ordinary convexity, monomial…
This work deals with the notion of Newton complementary duality as raised originally in the work of the second author and B. Costa. A conceptual revision of the main steps of the notion is accomplished which then leads to a vast…
Newton's method for polynomial root finding is one of mathematics' most well-known algorithms. The method also has its shortcomings: it is undefined at critical points, it could exhibit chaotic behavior and is only guaranteed to converge…
Here the polynomial interpolation approach is used to introduce the main results on multivariate normal algebraic systems. Next we bring a construction which shows that any standard algebraic system, with finite set of solutions, can be…
In this paper polynomial maps are represented by the use of matrices whose entries are numbered by pair of multiindices and a new product of such matrices is introduced. A matrix representation of composition of polynomial maps is given. In…
In this paper, we provide a unified definition of mediated graph, a combinatorial structure with multiple applications in mathematical optimization. We study some geometric and algebraic properties of this family of graphs and analyze…
We give a simple algorithm that determines whether a given post-critically finite topological polynomial is Thurston equivalent to a polynomial. If it is, the algorithm produces the Hubbard tree; otherwise, the algorithm produces the…
Multipath cohomology is a cohomology theory for directed graphs, which is defined using the path poset. The aim of this paper is to investigate combinatorial properties of path posets, and to provide computational tools for multipath…
Bilinear maps and their classifying tensor products are well-known in the theory of linear algebra, and their generalization to algebras of commutative monads is a classical result of monad theory. Motivated by constructions needed in…
For quantum systems described by finite matrices, linear and affine maps of matrices are shown to provide equivalent descriptions of evolution of density matrices for a subsystem caused by unitary Hamiltonian evolution in a larger system;…