Related papers: On the non-very generic intersections in discrimin…

We give an overview of recent progress around a problem introduced by Elekes and R\'onyai. The prototype problem is to show that a polynomial $f\in \mathbb{R}[x,y]$ has a large image on a Cartesian product $A\times B\subset \mathbb{R}^2$,…

A weak order on the set of maximal chains of the non-crossing partition lattice is introduced and studied. A $0$-Hecke algebra action is used to compute the radius of the graph on these chains in which two chains are adjacent if they differ…

Hypertrees and noncrossing trees are well-established objects in the combinatorics literature, but the hybrid notion of a noncrossing hypertree has received less attention. In this article I investigate the poset of noncrossing hypertrees…

One can make a distinction between "normal" and "special" models. For normal models $\theta_{23}$ is not too close to maximal and $\theta_{13}$ is not too small, typically a small power of the self-suggesting order parameter $\sqrt{r}$,…

Reading's "shard intersection order" on the symmetric group can be realized as the "lattice of wide subcategories" of the corresponding preprojective algebra. In this paper, we first use Bancroft's combinatorial model for the shard…

Arrangements of pseudohyperplanes are widely studied in computational geometry. A rich subclass of pseudohyerplane arrangements, which has gained more attention in recent years, is the so-called signotopes. Introduced by Manin and…

A regular $A_n$-crystal is an edge-colored directed graph, with $n$ colors, related to an irreducible highest weight integrable module over $U_q(sl_{n+1})$. Based on Stembridge's local axioms for regular simply-laced crystals and a…

A new notion of an optimal algebra for a first order coordinate differential was introduced in \cite{BKO}. Some relevant examples are indicated. Quadratic identities in the optimal algebras and calculi on quadratic algebras are studied.…

In 1989, Erd\H{o}s conjectured that for a sufficiently large $n$ it is impossible to place $n$ points in general position in a plane such that for every $1\le i \le n-1$ there is a distance that occurs exactly $i$ times. For small $n$ this…

A combinatorial design is a family of sets that are almost disjoint, which is applied in pseudo random number generations and randomness extractions. The parameter, $\rho$, quantifying the overlap between the sets within the family, is…

For $n \in \mathbb{N}$ and $\varepsilon > 0$, given a sufficiently long sequence of events in a probability space all of measure at least $\varepsilon$, some $n$ of them will have a common intersection. A more subtle pattern: for any $0 < p…

In the Standard Model, some combination of the baryon $\bf B$ and lepton $\bf L$ number symmetry is free of mixed anomalies with strong and electroweak $su(3) \times su(2) \times u(1)_{\tilde Y}$ gauge forces. However, it can still suffer…

The n-th crossing number of a graph G, denoted cr_n(G), is the minimum number of crossings in a drawing of G on an orientable surface of genus n. We prove that for every a>b>0, there exists a graph G for which cr_0(G) = a, cr_1(G) = b, and…

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…

In this paper, we study the cardinality of the distance set $\Delta(A, B)$ determined by two subsets $A$ and $B$ of the $d$-dimensional vector space over a finite field $\mathbb{F}_q$. Assuming that $A$ or $B$ lies in a $k$-coordinate plane…

Let $\mathcal O_r(n)$ be the set of $r$-regular partitions of $n$, $\mathcal D_r(n)$ the set of partitions of $n$ with parts repeated at most $r-1$ times, $\mathcal O_{1,r}(n)$ the set of partitions with exactly one part (possibly repeated)…

Various specifiable combinatorial structures, with d extensive parameters, can be exactly sampled both by the recursive method, with linear arithmetic complexity if a heavy preprocessing is performed, or by the Boltzmann method, with…

Consider a face F in an arrangement of n Jordan curves in the plane, no two of which intersect more than s times. We prove that the combinatorial complexity of F is O(\lambda_s(n)), O(\lambda_{s+1}(n)), and O(\lambda_{s+2}(n)), when the…

Walled Brauer algebras $B_N ( m , n ) $ illuminate the combinatorics of mixed tensor representations of $U(N)$, with $m$ copies of the fundamental and $n$ copies of the anti-fundamental representation. They lie at the intersection of…

Obtaining rigorous statistical guarantees for generalization under distribution shift remains an open and active research area. We study a setting we call combinatorial distribution shift, where (a) under the test- and…