Related papers: Quadratic matings and ray connections
2-level polytopes naturally appear in several areas of pure and applied mathematics, including combinatorial optimization, polyhedral combinatorics, communication complexity, and statistics. In this paper, we present a study of some 2-level…
Topological photonics provides a robust and flexible platform for controlling light, enabling functionalities such as backscattering-immune edge transport and slow-light propagation. In this work, we design and characterize photonic…
A polynomial knot in $\mathbb{R}^n$ is a smooth embedding of $\mathbb{R}$ in $\mathbb{R}^n$ such that the component functions are real polynomials. In the earlier paper with Mishra, we have studied the space $\mathcal{P}$ of polynomial…
Let $k>1$, and let $\mathcal{F}$ be a family of $2n+k-3$ non-empty sets of edges in a bipartite graph. If the union of every $k$ members of $\mathcal{F}$ contains a matching of size $n$, then there exists an $\mathcal{F}$-rainbow matching…
We develop dynamical theory for the family of holomorphic correspondences $\mathcal{F}_a$ proved by the current authors to be matings between the modular group and parabolic rational maps in the Milnor slice $Per_1(1)$ (in 'Mating quadratic…
At present, practical application and theoretical discussion of rough sets are two hot problems in computer science. The core concepts of rough set theory are upper and lower approximation operators based on equivalence relations. Matroid,…
We give a construction of a family of (weighted) graphs that are pairwise cospectral with respect to the normalized Laplacian matrix, or equivalently probability transition matrix. This construction can be used to form pairs of cospectral…
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.…
A projective rectangle is like a projective plane that has different lengths in two directions. We develop harmonic conjugation in projective rectangles. We construct projective rectangles in some harmonic matroids (matroids where harmonic…
A geometric graph is a graph whose vertex set is a set of points in the plane and whose edge set contains straight-line segments. A matching in a graph is a subset of edges of the graph with no shared vertices. A matching is called perfect…
We consider a generalized Jaynes-Cummings model of a two-level atom interacting with a multimode nondegenerate coherent field. The sum of the mode frequencies is equal to the two-level transition frequency, creating the resonance condition.…
A topological phase is a phase of matter which cannot be characterized by a local order parameter. It has been shown that gapped phases in 1D systems can be completely characterized using tools related to projective representations of the…
A matroid is a combinatorial structure that captures and generalizes the algebraic concept of linear independence under a broader and more abstract framework. Matroids are closely related with many other topics in discrete mathematics, such…
After giving an introduction to the procedure dubbed slow polynomial mating and stating a conjecture relating this to other notions of polynomial mating, we show conformally correct pictures of the slow mating of two degree 3 post…
Thurston parameterized quadratic invariant laminations with a non-invariant lamination, the quotient of which yields a combinatorial model for the Mandelbrot set. As a step toward generalizing this construction to cubic polynomials, we…
We give a combinatorial definition of "core entropy" for quadratic polynomials as the growth exponent of the number of certain precritical points in the Julia set (those that separate the $\alpha$ fixed point from its negative). This notion…
Let $\Gamma$ be a connected bridgeless metric graph, and fix a point $v$ of $\Gamma$. We define combinatorial iterated integrals on $\Gamma$ along closed paths at $v$, a unipotent generalization of the usual cycle pairing and the…
A theorem of Ritt states the a linearizer of a holomorphic function at a repelling fixed point is periodic only if the holomorphic map is conjugate to a power of $z$, a Chebyshev polynomial or a Latt\`es map. The converse, except for some…
It is well known that the dynamical behavior of a rational map $f:\widehat{\mathbb C}\to \widehat{\mathbb C}$ is governed by the forward orbits of the critical points of $f$. The map $f$ is said to be postcritically finite if every critical…
In this article we discuss classical theorems from Convex Geometry in the context of topological drawings and beyond. In a simple topological drawing of the complete graph $K_n$, any two edges share at most one point: either a common vertex…