Related papers: An abstract formulation of image partition regular…
Let n,d be positive integers, with d even (say d=2e). Let X_(n,d) denote the locus of degree d hypersurfaces in P^n which consist of two e-fold hyperplanes. We bound the regularity of the ideal of this variety. Moreover, we show that this…
We consider a variational convex relaxation of a class of optimal partitioning and multiclass labeling problems, which has recently proven quite successful and can be seen as a continuous analogue of Linear Programming (LP) relaxation…
A new combinatorial object is introduced, the part-frequency matrix sequence of a partition, which is elementary to describe and is naturally motivated by Glaisher's bijection. We prove results that suggest surprising usefulness for such a…
We undertake a regularity analysis of the solutions to initial/boundary value problems for the (third-order in time) Moore-Gibson-Thompson (MGT) equation. The key to the present investigation is that the MGT equation falls within a large…
In a celebrated article, Moreira proved for every finite coloring of the set of naturals, there exists a monochromatic copy of the form $\{x,x+y,xy\},$ which gives a partial answer to one of the central open problems of Ramsey theory asking…
In recent years increasing attention has been paid on the area of supercharacter theories, especially to those of the upper unitriangular group. A particular supercharacter theory, in which supercharacters are indexed by set partitions, has…
Since the theorems of Schur and van der Waerden, numerous partition regularity results have been proved for linear equations, but progress has been scarce for non-linear ones, the hardest case being equations in three variables. We prove…
We show that the pattern $\{x,x+y,xy\}$ is partition regular over the space of formal integer polynomials of degree at least one with zero constant term, with primitive recursive bounds. This provides a new proof for the partition…
The Standard Simplex Conjecture of Isaksson and Mossel asks for the partition $\{A_{i}\}_{i=1}^{k}$ of $\mathbb{R}^{n}$ into $k\leq n+1$ pieces of equal Gaussian measure of optimal noise stability. That is, for $\rho>0$, we maximize $$…
We generalize the stable graph regularity lemma of Malliaris and Shelah to the case of finite structures in finite relational languages, e.g., finite hypergraphs. We show that under the model-theoretic assumption of stability, such a…
We present a new approach to convergence rate results for variational regularization. Avoiding Bregman distances and using image space approximation rates as source conditions we prove a nearly minimax theorem showing that the modulus of…
Partitions with initial repetitions were introduced by George Andrews. We consider a subclass of these partitions and find Legendre theorems associated with their respective partition functions. The results in turn provide partition…
Algorithmic randomness theory starts with a notion of an individual random object. To be reasonable, this notion should have some natural properties; in particular, an object should be random with respect to image distribution if and only…
Suppose a $k$-uniform hypergraph $H$ that satisfies a certain regularity instance (that is, there is a partition of $H$ given by the hypergraph regularity lemma into a bounded number of quasirandom subhypergraphs of prescribed densities).…
Partition regularity over algebraic structures is a topic in Ramsey theory that has been extensively researched by combinatorialists. Motivated by recent work in this area, we investigate the computability-theoretic and reverse-mathematical…
A partial regularity theorem is presented for minimisers of $k$th-order functionals subject to a quasiconvexity and general growth condition. We will assume a natural growth condition governed by an $N$-function satisfying the $\Delta_2$…
Szemer\'edi's regularity lemma and its variants are some of the most powerful tools in combinatorics. In this paper, we establish several results around the regularity lemma. First, we prove that whether or not we include the condition that…
We present a structural resolution to the exact evaluation of the partition function $p_k(n)$, systematically overcoming the limitations of traditional recursive and asymptotic methods. By framing the partition polytope $\mathcal{P}_{n,k}$…
We study a bijective map from integer partitions to the prime factorizations of integers that we call the "supernorm" of a partition, in which the multiplicities of the parts of partitions are mapped to the multiplicities of prime factors…
We classify the pairs of conjugate partitions whose regularisations are images of each other under the Mullineux map. This classification proves a conjecture of Lyle, answering a question of Bessenrodt, Olsson and Xu.