Related papers: Sharp Inner Product Correlations for Hypercube Bij…
We establish a bijective correspondence between Smirnov words with balanced letter multiplicities and Hamiltonian paths in complete $m$-partite graphs $K_{n,n,\ldots,n}$. This bijection allows us to derive closed inclusion-exclusion…
In this work, we expose four bijections each allowing to increase (or decrease) one parameter in either uniform random forests with a fixed number of edges and trees, or quadrangulations with a boundary having a fixed number of faces and a…
We discuss scaling limits of large bipartite quadrangulations of positive genus. For a given $g$, we consider, for every $n \ge 1$, a random quadrangulation $\q_n$ uniformly distributed over the set of all rooted bipartite quadrangulations…
Let $S_n$ and $S_{n,k}$ be, respectively, the number of subsets and $k$-subsets of $\mathbb{N}_n=\{1,\ldots,n\}$ such that no two subset elements differ by an element of the set $\mathcal{Q}$, the largest element of which is $q$. We prove a…
In this paper we study the tangent space to the Hilbert scheme $\mathrm{Hilb}^d \mathbf{P}^3$, motivated by Haiman's work on $\mathrm{Hilb}^d \mathbf{P}^2$ and by a long-standing conjecture of Brian\c{c}on and Iarrobino on the most singular…
A middle-cube is an induced subgraph consisting of nodes at the middle two layers of a hypercube. The middle-cubes are related to the well-known Revolving Door (Middle Levels) conjecture. We study the middle-cube graph by completely…
We provide spectral Lie algebras with enveloping algebras over the operad of little $G$-framed $n$-dimensional disks for any choice of dimension $n$ and structure group $G$, and we describe these objects in two complementary ways. The first…
We give a different presentation of a recent bijection due to Chapuy and Dol\k{e}ga for nonorientable bipartite quadrangulations and we extend it to the case of nonorientable general maps. This can be seen as a Bouttier--Di…
Generalizing a result of Miyakawa, Nozaki, Pogosyan and Rosenberg, we prove that there is a one-to-one correspondence between the set of intersecting antichains in a subset of the lower half of the k-valued n-cube and the set of…
We establish a loop space decomposition for certain $CW$-complexes with a single top cell in the presence of a spherical pair, thereby generalizing several known decompositions of Poincar\'{e} duality complexes in which a loop of a product…
Three-dimensional quadratic diffeomorphisms with quadratic inverse generically have five independent parameters. When some parameters approach infinity, the diffeomorphisms may exhibit a so-called anti-integrable limit in the traditional…
We consider two types of problems: maximising, over subsets $S\subseteq \{0,1\}^n$, the density of $d$-subcubes $C$ in the $n$-hypercube graph that span a subgraph such that $S\cap C$ is i) isomorphic to the given configuration…
We study the structure of sets $S\subseteq\{0, 1\}^n$ with small sensitivity. The well-known Simon's lemma says that any $S\subseteq\{0, 1\}^n$ of sensitivity $s$ must be of size at least $2^{n-s}$. This result has been useful for proving…
We deal with countable alphabet locally compact random subshifts of finite type (the latter merely meaning that the symbol space is generated by an incidence matrix) under the absence of Big Images Property and under the absence of uniform…
The Kervaire Invariant 1 Problem until recently was an open problem in algebraic topology. Hill-Hopkins-Ravenel theorem clams a negative solution of the problem for all dimensions $n=2^l-2$, $l \ge 8$. We prove the statement of…
A famous conjecture of Graham asserts that every set $A \subseteq \mathbb{Z}_p \setminus \{0\}$ can be ordered so that all partial sums are distinct. Bedert and Kravitz proved that this statement holds whenever $|A| \leq e^{c(\log…
Let $f:\, S \to B$ be a locally non-trivial relatively minimal fibration of hyperelliptic curves of genus $g\geq 2$ with relative irregularity $q_f$. We show a sharp lower bound on the slope $\lambda_f$ of $f$. As a consequence, we prove a…
We present progress on the problem of asymptotically describing the adjacency eigenvalues of random and complete uniform hypergraphs. There is a natural conjecture arising from analogy with random matrix theory that connects these spectra…
For integers $k,n$ with $1 \le k \le n/2$, let $f(k,n)$ be the smallest integer $t$ such that every $t$-connected $n$-vertex graph has a spanning bipartite $k$-connected subgraph. A conjecture of Thomassen asserts that $f(k,n)$ is upper…
For $S \subseteq \{0,1\}^n$ a Boolean function $f \colon S \to \{-1,1\}$ is a polynomial threshold function (PTF) of degree $d$ and weight $W$ if there is a polynomial $p$ with integer coefficients of degree $d$ and with sum of absolute…