Related papers: A partial answer to the Demyanov-Ryabova conjectur…

We investigate completed interlacing of zeros for pairs of polynomial sequences that fail to interlace by exactly two points. Using a general mixed recurrence relation, we identify a quadratic polynomial whose zeros serve as the two extra…

Define $S(n,\beta)$ to be the set of complex polynomials of degree $n \ge 2$ with all roots in the unit disk and at least one root at $\beta$. For a polynomial $P$, define $|P|_\beta$ to be the distance between $\beta$ and the closest root…

We prove a conjecture of Goncharov, which says that any multiple polylogarithm can be expressed via polylogarithms of depth at most half of the weight. We give an explicit formula for this presentation, involving a summation over trees that…

In this paper, we prove that for a regular polynomial endomorphism of positive degree on $\mathbb{P}^2$, a family of curves containing a Zariski dense set of periodic curves is invariant under some iterate of the endomorphism. The setting…

We show that the Vojta (or Hall-Lang) conjecture implies that the arboreal Galois representations in a 1-parameter family of quadratic polynomials are surjective if and only if they surject onto some finite and uniform quotient. As an…

Sometimes, it is possible to represent a complicated polytope as a projection of a much simpler polytope. To quantify this phenomenon, the extension complexity of a polytope $P$ is defined to be the minimum number of facets of a (possibly…

In this paper we discuss the sufficient and necessary conditions for multiple Alexandrov spaces being glued to an Alexandrov space. We propose a Gluing Conjecture, which says that the finite gluing of Alexandrov spaces is an Alexandrov…

We generalise the notion of cluster structures from the work of Buan-Iyama-Reiten-Scott to include situations where the endomorphism rings of the clusters may have loops. We show that in a Hom-finite 2-Calabi-Yau category, the set of…

We define the excess degree $\xi(P)$ of a $d$-polytope $P$ as $2f_1-df_0$, where $f_0$ and $f_1$ denote the number of vertices and edges, respectively. This parameter measures how much $P$ deviates from being simple. It turns out that the…

In a sequence of four papers, we prove the following results (via a unified approach) for all sufficiently large $n$: (i) [1-factorization conjecture] Suppose that $n$ is even and $D\geq 2\lceil n/4\rceil -1$. Then every $D$-regular graph…

Rectangulations are decompositions of a square into finitely many axis-aligned rectangles. We describe realizations of $(n-1)$-dimensional polytopes associated with two combinatorial families of rectangulations composed of $n$ rectangles.…

Generic bifurcation theory was classically well developed for smooth differential systems, establishing results for $k$-parameter families of planar vector fields. In the present study we focus on a qualitative analysis of $2$-parameter…

If we fix the angles at the vertices of a convex planar $n$-gon, the lengths of its edges must satisfy two linear constraints in order for it to close up. If we also require unit perimeter, our vectors of $n$ edge lengths form a convex…

Sidorenko's Conjecture says that the minimum density of a bigraph $G$ in a bigraphon $W$ of a given edge density is attained when $W$ is a constant function. A consequence of a result by B. Szegedy is that it is enough to show Sidorenko's…

For a stationary Poisson hyperplane tessellation $X$ in ${\mathbb R}^d$, whose directional distribution satisfies some mild conditions (which hold in the isotropic case, for example), it was recently shown that with probability one every…

A two-step model for generating random polytopes is considered. For parameters $d$, $m$, and $p$, the first step is to generate a simple polytope $P$ whose facets are given by $m$ uniform random hyperplanes tangent to the unit sphere in…

A conjecture of Sendov states that if a polynomial has all its roots in the unit disk and if $\beta$ is one of those roots, then within one unit of $\beta$ lies a root of the polynomial's derivative. If we define $r(\beta)$ to be the…

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…

In this paper we address the graph matching problem. Following the recent works of \cite{zaslavskiy2009path,Vestner2017} we analyze and generalize the idea of concave relaxations. We introduce the concepts of conditionally concave and…

Consider a finite positive integer. If it is even, divide it by 2, and if it is odd, multiply it by 3 and add 1. This will give you a new integer. Following the procedure for the new integer, you will receive another integer. Repeat the…