Related papers: Symmetric Proofs in the Ideal Proof System
In this paper we study the groups of isometries and the set of bi-Lipschitz automorphisms of spectral triples from a metric viewpoint, in the propinquity framework of Latremoliere. In particular we prove that these groups and sets are…
In this paper, we study the coupled Einstein constraint equations on complete manifolds through the conformal method, focusing on non-compact manifolds with flexible asymptotics. This is physically well-motivated by standard cosmological…
We prove measurable analogues of Whitney's classical theorems on weak isomorphisms of finite graphs. In the setting of locally finite graphings, we introduce a notion of weak isomorphism as an edge-measure-preserving Borel bijection that…
Consider a family $\mathcal F$ of $C_{2r+1}$-free graphs, where $r\geq 2$. Suppose that each graph in $\mathcal F$ has minimum degree linear in its number of vertices. Thomassen showed that such a family has bounded chromatic number, or,…
Pairwise comparison matrices are increasingly used in settings where some pairs are missing. However, there exist few inconsistency indices for similar incomplete data sets and no reasonable measure has an associated threshold. This paper…
We obtain new bounds for the optimal matching cost for empirical measures with unbounded support. For a large class of radially symmetric and rapidly decaying probability laws, we prove for the first time the asymptotic rate of convergence…
Gapless quantum phases can become distinct when internal symmetries are enforced, in analogy with gapped symmetry-protected topological (SPT) phases. However, this distinction does not always lead to protected edge modes, raising the…
Notions of graph similarity provide alternative perspective on the graph isomorphism problem and vice-versa. In this paper, we consider measures of similarity arising from mismatch norms as studied in Gervens and Grohe: the edit distance…
The inconsistency of pairwise comparisons remains difficult to interpret in the absence of acceptability thresholds. The popular 10% cut-off rule proposed by Saaty has recently been applied to incomplete pairwise comparison matrices, which…
We report a proof of the quantum Sanov Theorem by elementary application of basic facts about representations of the symmetric group, together with a complete characterization of the optimal error exponent in a situation where the null…
This brief note publicizes the quantum framework for symmetry that is developed in our joint paper arXiv:2209.07471 with Greg Moore and Constantin Teleman. We include additional motivation and an application to a selection rule for line…
A class of information inequalities, called Shannon-type inequalities (STIs), can be proven via a computer software called ITIP. In previous work, we have shown how this technique can be utilized to Fourier-Motzkin elimination algorithm for…
The Ideal Membership Problem (IMP) tests if an input polynomial $f\in \mathbb{F}[x_1,\dots,x_n]$ with coefficients from a field $\mathbb{F}$ belongs to a given ideal $I \subseteq \mathbb{F}[x_1,\dots,x_n]$. It is a well-known fundamental…
A central question in mathematics and computer science is the question of determining whether a given ideal $I$ is prime, which geometrically corresponds to the zero set of $I$, denoted $Z(I)$, being irreducible. The case of principal…
We give an isomorphism test for graphs of Euler genus $g$ running in time $2^{O(g^4 \log g)}n^{O(1)}$. Our algorithm provides the first explicit upper bound on the dependence on $g$ for an fpt isomorphism test parameterized by the Euler…
A Boolean constraint satisfaction instance is a conjunction of constraint applications, where the allowed constraints are drawn from a fixed set B of Boolean functions. We consider the problem of determining whether two given constraint…
We discuss the interrelations between symmetry of an Ito stochastic differential equations (or systems thereof) and its integrability, extending in party results by R. Kozlov [J. Phys. A ${\bf 43}$ (2010) \& ${\bf 44}$ (2011)]. Together…
This paper is a fusion of a survey and a research article. We focus on certain rigidity phenomena in function spaces associated to a symplectic manifold. Our starting point is a lower bound obtained in an earlier paper with Zapolsky for the…
This paper extends prior work on the connections between logics from finite model theory and propositional/algebraic proof systems. We show that if all non-isomorphic graphs in a given graph class can be distinguished in the logic…
Here several perfect simulation algorithms are brought under a single framework, and shown to derive from the same probabilistic result, called here the Fundamental Theorem of Perfect Simulation (FTPS). An exact simulation algorithm has…