Related papers: Eliminating Human Insight: An Algorithmic Proof of…

It has been proven that the lozenge tilings of a quartered hexagon on the triangular lattice are enumerated by a simple product formula. In this paper we give a new proof for the tiling formula by using Kuo's graphical condensation. Our…

We introduce a generalization of tropical polyhedra able to express both strict and non-strict inequalities. Such inequalities are handled by means of a semiring of germs (encoding infinitesimal perturbations). We develop a tropical…

We show that the two dimensional Ising model is complete, in the sense that the partition function of any lattice model on any graph is equal to the partition function of the 2D Ising model with complex coupling. The latter model has all…

Using a metaprogramming technique and semialgebraic computations, we provide computer-based proofs for old and new cutting-plane theorems in Gomory--Johnson's model of cut generating functions.

In representation theory of finite-dimensional algebras, (semi)bricks are a generalization of (semi)simple modules, and they have long been studied. The aim of this paper is to study semibricks from the point of view of $\tau$-tilting…

The Alder-Andrews Theorem, a partition inequality generalizing Euler's partition identity, the first Rogers-Ramanujan identity, and a theorem of Schur to $d$-distinct partitions of $n$, was proved successively by Andrews in 1971, Yee in…

We give a probabilistic interpretation of the coefficients of the elementary symmetric function expansion of the chromatic quasisymmetric function for any unit interval graph. As a corollary, we prove the Stanley--Stembridge conjecture.

The traveling salesman problem (TSP) is a fundamental problem in combinatorial optimization. Several semidefinite programming relaxations have been proposed recently that exploit a variety of mathematical structures including, e.g.,…

Tverberg's theorem states that any set of $t(r,d)=(r-1)(d+1)+1$ points in $\mathbb{R}^d$ can be partitioned into $r$ subsets whose convex hulls have non-empty $r$-fold intersection. Moreover, generic collections of fewer points cannot be so…

We prove an asymptotic formula for the number of partitions of $n$ into distinct parts where the largest part is at most $t\sqrt{n}$ for fixed $t \in \mathbb{R}$. Our method follows a probabilistic approach of Romik, who gave a simpler…

In 1969, Andrews proved a theorem on partitions with difference conditions which generalises Schur's celebrated partition identity. In this paper, we generalise Andrews' theorem to overpartitions. The proof uses q-differential equations and…

In this thesis, we investigate the asymptotics of random partitions chosen according to probability measures coming from the representation theory of the symmetric groups $S_n$ and of the finite Chevalley groups $GL(n,F_q)$ and…

The superiority of stochastic symplectic methods over non-symplectic counterparts has been verified by plenty of numerical experiments, especially in capturing the asymptotic behaviour of the underlying solution process. How can one…

We prove Tamura's theorem on partitions of the set of positive integers (a generalization of the more famous Rayleigh-Beatty theorem) using the positive $\mathbb{S}^1$-equivariant symplectic homology.

In this paper we propose a computational approach to proving the Birkhoff conjecture on the restricted three-body problem, which asserts the existence of a disk-like global surface of section. Birkhoff had conjectured this surface of…

In a recent work, Andrews gave analytic proofs of two conjectures concerning some variations of two combinatorial identities between partitions of a positive integer into odd parts and partitions into distinct parts discovered by Beck.…

In these notes we give a brief introduction to decomposition theory and we summarize some classical and well-known results. The main question is that if a partitioning of a topological space (in other words a decomposition) is given, then…

This paper is the second in a series of planned papers which provide first bijective proofs of alternating sign matrix results. Based on the main result from the first paper, we construct a bijective proof of the enumeration formula for…

Je\v{r}\'abek showed that cuts in classical propositional logic proofs in deep inference can be eliminated in quasipolynomial time. The proof is indirect and it relies on a result of Atserias, Galesi and Pudl\'ak about monotone sequent…

Let k be a totally real number field ant let k$\infty$ be its cyclotomic Zp-extension for a prime p\textgreater{}2. We give (Theorem 3.2) a sufficient condition of nullity of the Iwasawa invariants lambda, mu, when p totally splits in k,…