Related papers: Fixed Flowers
A rectangulation is a decomposition of a rectangle into finitely many rectangles. Via natural equivalence relations, rectangulations can be seen as combinatorial objects with a rich structure, with links to lattice congruences, flip graphs,…
Motivated by applications in the medical sciences, we study finite chromatic sets in Euclidean space from a topological perspective. Based on the persistent homology for images, kernels and cokernels, we design provably stable homological…
Models which allow an explicit application to structurally modulated substances are reviewed within the frame of a symmetry-based approach starting from discrete lattice theory. Focus is set on models formulated in terms of local variables…
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…
A sunflower is a collection of sets $\{U_1,\ldots, U_n\}$ such that the pairwise intersection $U_i\cap U_j$ is the same for all choices of distinct $i$ and $j$. We study sunflowers of convex open sets in $\mathbb R^d$, and provide a…
The theory of polynomial-like maps is of fundamental importance in holomorphic dynamics. We study dynamical properties of a larger class of maps. Our main result is that, under some natural conditions, a map of this class has a completely…
A coincidence site lattice is a sublattice formed by the intersection of a lattice $\Gamma$ in $\mathbb{R}^d$ with the image of $\Gamma$ under a linear isometry. Such a linear isometry is referred to as a linear coincidence isometry of…
We show that if $P$ is a quadratic polynomial with a fixed Cremer point and Julia set $J$, then for any monotone map $\ph:J\to A$ from $J$ onto a locally connected continuum $A$, $A$ is a single point.
Combinatorial optimization can be described as the problem of finding a feasible subset that maximizes a objective function. The paper discusses combinatorial optimization problems, where for each dimension the set of feasible subsets is…
Conjugation, or Legendre transformation, is a basic tool in convex analysis, rational mechanics, economics and optimization. It maps a function on a linear topological space into another one, defined in the dual of the linear space by…
Unimodularity is localized to a complete stationary type, and its properties are analysed. Some variants of unimodularity for definable and type-definable sets are introduced, and the relationship between these different notions is studied.…
A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…
Moire lattices consist of two identical periodic structures overlaid with a relative rotation angle. Present even in everyday life, moire lattices have been also produced, e.g., with coupled graphene-hexagonal boron nitride monolayers,…
We develop an abstract look at linear optical networks from the viewpoint of combinatorics and permanents. In particular we show that calculation of matrix elements of unitarily transformed photonic multi-mode states is intimately linked to…
Lattice theory has been believed to resist classical computers and quantum computers. Since there are connections between traditional lattices and graphic lattices, it is meaningful to research graphic lattices. We define the so-called…
We study filling sets of simple closed curves on punctured surfaces. In particular we study lower bounds on the cardinality of sets of curves that fill and that pairwise intersect at most k times on surfaces with given genus and number of…
We introduce a fixed point iteration process built on optimization of a linear function over a compact domain. We prove the process always converges to a fixed point and explore the set of fixed points in various convex sets. In particular,…
One studies Cremona monomial maps by combinatorial means. Among the results is a simple integer matrix theoretic proof that the inverse of a Cremona monomial map is also defined by monomials of fixed degree, and moreover, the set of…
This article is a short review on the relationship between convergent matrix integrals, formal matrix integrals, and combinatorics of maps. We briefly summarize results developed over the last 30 years, as well as more recent discoveries.…
We describe a deterministic process to associate a practical, permanent label to isomorphism classes of abelian varieties defined over finite fields with commutative endomorphism algebra as long as they are ordinary or defined over a prime…