Related papers: Combinatorial properties of Newton maps
In 'An asymptotic result on compressed sensing matrices', a new construction for compressed sensing matrices using combinatorial design theory was introduced. In this paper, we use deterministic and probabilistic methods to analyse the…
This is a book on higher-categorical diagrams, including pasting diagrams. It aims to provide a thorough and modern reference on the subject, collecting, revisiting and expanding results scattered across the literature, informed by recent…
A novel polynomial expansion method of symmetric Boolean functions is described. The method is efficient for symmetric Boolean function with small set of valued numbers and has the linear complexity for elementary symmetric Boolean…
We give combinatorial formulas for F-polynomials in cluster algebras of classical types in terms of the weighted paths in certain directed graphs. As a consequence we prove the positivity of F-polynomials in cluster algebras of classical…
Matrix field theory is a combinatorially non-local field theory which has recently been found to be a non-trivial but solvable QFT example. To generalize such non-perturbative structures to other models, a more combinatorial understanding…
In this paper, we construct geometrically finite rational maps with buried critical points on the boundaries of some hyperbolic components by using the pinching and plumbing deformations.
Orbit portraits were introduced by Milnor as a combinatorial tool to describe the patterns of all periodic dynamical rays landing on a periodic cycle of a quadratic polynomial. This encodes information about the dynamics and the parameter…
The purpose of this paper is to study some properties of the Newton maps associated to real quintic polynomials. First using the Tschirnhaus transformation, we reduce the study of Newton's method for general quintic polynomials to the case…
We obtain, for the first time, a modular many-valued semantics for combined logics, which is built directly from many-valued semantics for the logics being combined, by means of suitable universal operations over partial non-deterministic…
We develop a combinatorial model of the associated Hermite polynomials and their moments, and prove their orthogonality with a sign-reversing involution. We find combinatorial interpretations of the moments as complete matchings, connected…
This paper introduces combinatorial representations, which generalise the notion of linear representations of matroids. We show that any family of subsets of the same cardinality has a combinatorial representation via matrices. We then…
Lorenz maps are maps of the unit interval with one critical point of order rho>1, and a discontinuity at that point. They appear as return maps of leafs of sections of the geometric Lorenz flow. We construct real a priori bounds for…
Ramsey theory looks for regularities in large objects. Model theory studies algebraic structures as models of theories. The structural Ramsey theory combines these two fields and is concerned with Ramsey-type questions about certain…
The dynamics of coupled intermittent maps is used to model the correlated structure of genomic sequences. The use of intermittent maps, as opposed to other simple chaotic maps, is particularly suited for the production of long range…
In this text we develop the formalism of products and powers of linear codes under componentwise multiplication. As an expanded version of the author's talk at AGCT-14, focus is put mostly on basic properties and descriptive statements that…
In this paper, we study the combinatorics of a subcomplex of the Bloch-Kriz cycle complex [4] used to construct the category of mixed Tate motives. The algebraic cycles we consider properly contain the subalgebra of cycles that correspond…
Let $\mathbb C$ be the set of complex numbers, and let $\mathcal P$ be a collection of complex polynomial maps in several variables. Assuming at least one $P\in\mathcal P$ depends on at least two variables, we classify all possibilities for…
We first find the combinatorial degree of any map $f:V\to F$ where $F$ is a finite field and $V$ is a finite-dimensional vector space over $F$. We then simplify and generalize a certain construction due to Chein and Goodaire that was used…
We consider systems of recursively defined combinatorial structures. We give algorithms checking that these systems are well founded, computing generating series and providing numerical values. Our framework is an articulation of the…
We find all quadratic post-critically finite (PCF) rational maps defined over the rationals. We describe an algorithm to search for possibly PCF maps. Using the algorithm, we eliminate all but twelve rational maps, all of which are…