English
Related papers

Related papers: Sharp Inner Product Correlations for Hypercube Bij…

200 papers

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…

Combinatorics · Mathematics 2025-10-31 El-Mehdi Mehiri

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…

Probability · Mathematics 2014-01-16 Jérémie Bettinelli

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…

Probability · Mathematics 2010-12-20 Jérémie Bettinelli

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…

Combinatorics · Mathematics 2025-07-22 Michael A. Allen

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…

Algebraic Geometry · Mathematics 2023-02-08 Ritvik Ramkumar , Alessio Sammartano

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…

Combinatorics · Mathematics 2009-11-03 Ke Qiu , Rong Qiu , Yong Jiang , Jian Shen

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…

Algebraic Topology · Mathematics 2018-12-19 Ben Knudsen

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…

Combinatorics · Mathematics 2022-11-04 Jérémie Bettinelli

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…

Combinatorics · Mathematics 2011-12-01 Roman Glebov

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…

Algebraic Topology · Mathematics 2026-01-06 Ruizhi Huang

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…

Dynamical Systems · Mathematics 2025-05-13 Yi-Chiuan Chen

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…

Combinatorics · Mathematics 2025-10-08 Levente Bodnár , Oleg Pikhurko

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…

Computational Complexity · Computer Science 2016-06-08 Andris Ambainis , Jevgēnijs Vihrovs

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…

Dynamical Systems · Mathematics 2015-09-02 Volker Mayer , Mariusz Urbanski

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…

Algebraic Topology · Mathematics 2025-12-17 Petr M. Akhmet'ev

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…

Combinatorics · Mathematics 2025-08-20 Simone Costa , Stefano Della Fiore , Eva R. Engel

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…

Algebraic Geometry · Mathematics 2015-02-12 Xin Lu , Kang Zuo

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…

Combinatorics · Mathematics 2018-01-10 Joshua Cooper

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…

Combinatorics · Mathematics 2024-03-26 Raphael Yuster

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…

Computational Complexity · Computer Science 2022-12-22 Vladimir Podolskii , Nikolay V. Proskurin