Related papers: Regular polygraphs and the Simpson conjecture
We continue the development of the infinitesimal deformation theory of pasting diagrams of k-linear categories begun in Yetter, D.N. "On Deformations of Pasting Diagrams", Theory and Applications of Categories 22 (2009) 24-53. In that…
Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the…
In this paper we study the regularity of the local minima of integral functionals: in particular, not convexity (quasi-convexity, policonvexity or rank one convexity) hypothesis will be made on the density, neither structure hypothesis nor…
We prove a compact embedding theorem in a class of spaces of piecewise H1 functions subordinated to a class of shape regular, but not necessarily quasi-uniform triangulations of a polygonal domain. This result generalizes the…
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. Although this conjecture was recently proved for sufficiently large primes by Pham and…
It is well known that normality can be described as incompressibility via finite automata. Still the statement and the proof of this result as given by Becher and Heiber (2013) in terms of "lossless finite-state compressors" do not follow…
We observe that the nonstandard finite cardinality of a definable set in a strongly minimal pseudofinite structure D is a polynomial over the integers in the nonstandard finite cardinality of D. We conclude that D is unimodular, hence also…
We present a method which allows the combination of forcing uniformization on the $\Pi$- and the $\Sigma$-side of the projective hierarchy to a certain extent. Using this method we construct a universe where ${\Pi}^1_3$-reduction holds,…
A slice decomposition is an expression of a homogeneous polynomial as a sum of forms with a linear factor. A strength decomposition is an expression of a homogeneous polynomial as a sum of reducible forms. The slice rank and strength of a…
A generalization of Young's inequality for convolution with sharp constant is conjectured for scenarios where more than two functions are being convolved, and it is proven for certain parameter ranges. The conjecture would provide a unified…
We obtain a generic regularity result for stationary integral $n$-varifolds with only strongly isolated singularities inside $N$-dimensional Riemannian manifolds, in absence of any restriction on the dimension ($n\geq 2$) and codimension.…
Let $S$ be a semigroup (written multiplicatively). Endowed with the operation of setwise multiplication induced by $S$ on its parts, the non-empty subsets of $S$ form themselves a semigroup, denoted by $\mathcal P(S)$. Accordingly, we say…
We study projective functions. We prove that projective functions generalise lower and upper-semianalytic ones while being stable by composition and difference. We show that the class of projective functions is closed under sums,…
We generalize the notion of an anomaly for a symmetry to a noninvertible symmetry enacted by surface operators using the framework of condensation in 2-categories. Given a multifusion 2-category, potentially with some additional levels of…
Based on a reduction processing, we rewrite a hypergeometric term as the sum of the difference of a hypergeometric term and a reduced hypergeometric term (the reduced part, in short). We show that when the initial hypergeometric term has a…
In this paper we propose a generalization of the Kontsevich--Soibelman conjecture on the degeneration of Hochschild-to-cyclic spectral sequence for smooth and compact DG category. Our conjecture states identical vanishing of a certain map…
A classification is a surjective mapping from a set of objects to a set of categories. A classification aggregation function aggregates every vector of classifications into a single one. We show that every citizen sovereign and independent…
The standard stabilizer formalism provides a setting to show that quantum computation restricted to operations within the Clifford group are classically efficiently simulable: this is the content of the well-known Gottesman-Knill theorem.…
The first part of the paper centers in the study of embeddability between partially commutative groups. In [KK], for a finite simplicial graph $\Gamma$, the authors introduce an infinite, locally infinite graph $\Gamma^e$, called the…
One of the major open problems in complexity theory is proving super-logarithmic lower bounds on the depth of circuits (i.e., $\mathbf{P}\not\subseteq\mathbf{NC}^{1}$). Karchmer, Raz, and Wigderson (Computational Complexity 5(3/4), 1995)…