Related papers: A minimaj-preserving crystal on ordered multiset p…
In this paper we settle a weak version of a conjecture (i.e. Conjecture 6) by Mills, Robbins and Rumsey in the paper "Self-complementary totally symmetric plane partitions" (J. Combin. Theory Ser. A 42, 277-292). In other words we show that…
We construct a framework for studying clustering algorithms, which includes two key ideas: persistence and functoriality. The first encodes the idea that the output of a clustering scheme should carry a multiresolution structure, the second…
The number partitioning problem is a classic problem of combinatorial optimization in which a set of $n$ numbers is partitioned into two subsets such that the sum of the numbers in one subset is as close as possible to the sum of the…
We study the stability of partitions involving two or more phases in convex domains under the assumption of at most two-phase contact, thus excluding in particular triple junctions. We present a detailed derivation of the second variation…
Given a partition $\lambda$ corresponding to a dominant integral weight of $\mathfrak{sl}_n$, we define the structure of crystal on the set of 5-vertex ice models satisfying certain boundary conditions associated to $\lambda$. We then show…
A scarcely known generalization of Goldbach's conjecture introduced by Hardy and Littlewood states that for every pair of (relatively prime) positive integers m1 and m2, every sufficiently large integer n satisfying certain simple…
Although the prime numbers are deterministic, they can be viewed, by some measures, as pseudo-random numbers. In this article, we numerically study the pair statistics of the primes using statistical-mechanical methods, especially the…
Frankl's union-closed sets conjecture states that in every finite union-closed set of sets, there is an element that is contained in at least half of the member-sets (provided there are at least two members). The conjecture has an…
In this paper, we revisit pattern mining and study the distribution underlying a binary dataset thanks to the closure structure which is based on passkeys, i.e., minimum generators in equivalence classes robust to noise. We introduce…
In this paper we point out that the generalized statistics of Tsallis-Havrda-Charv\'at can be conveniently used as a conceptual framework for statistical treatment of random chains. In particular, we use the path-integral approach to show…
We give combinatorial proofs of several recent results due to Merca on the sum of different parts congruent to $r$ modulo $m$ in all partitions of $n$. The proofs make use of some well known involutions from the literature and some new…
We prove that every partially ordered set on $n$ elements contains $k$ subsets $A_{1},A_{2},\dots,A_{k}$ such that either each of these subsets has size $\Omega(n/k^{5})$ and, for every $i<j$, every element in $A_{i}$ is less than or equal…
We consider probability distributions with constant rate on partially ordered sets, generalizing distributions in the usual reliability setting that have constant failure rate. In spite of the minimal algebraic structure, there is a…
Even though Zaremba's conjecture remains open, Bourgain and Kontorovich solved the problem for a full density subset. Nevertheless, there are only a handful of explicit sequences known to satisfy the strong version of the conjecture, all of…
The ultrafilters on the partial order $([\omega]^{\omega},\subseteq^*)$ are the free ultrafilters on $\omega$, which constitute the space $\omega^*$, the Stone-Cech remainder of $\omega$. If $U$ is an upperset of this partial order (i.e., a…
We find an involution as a combinatorial proof of a Ramanujan's partial theta identity. Based on this involution, we obtain a Franklin type involution for squares in the sense that the classical Franklin involution provides a combinatorial…
A conjecture of Graham (repeated by Erd\H{o}s) asserts that for any set $A \subseteq \mathbb{F}_p \setminus \{0\}$, there is an ordering $a_1, \ldots, a_{|A|}$ of the elements of $A$ such that the partial sums $a_1, a_1+a_2, \ldots,…
We discuss some well-known compactness principles for uncountable structures of small regular sizes ($\omega_n$ for $2 \le n<\omega$, $\aleph_{\omega+1}$, $\aleph_{\omega^2+1}$, etc.), consistent from weakly compact (the size-restricted…
The Goulden$\unicode{x2013}$Jackson cluster method, adapted to permutations by Elizalde and Noy, reduces the problem of counting permutations by occurrences of a prescribed consecutive pattern to that of counting clusters, which are special…
A conjecture by Deutsch, Kitaev, and Remmel states that the triples of permutation statistics $(S_{10}, S_{12}, S_{17})$ and $(S_{12}, S_{10} ,S_{17})$ are equidistributed over the symmetric group $\mathfrak{S}_n$. Here, $S_{10}$ enumerates…