Related papers: Symmetric Proofs in the Ideal Proof System
We use the concept of a Kirchhoff resistor network (alternatively random walk on a network) to probe connected graphs and produce symmetry revealing canonical labelings of the graph(s) nodes and edges.
We revisit the problem of counting the number of copies of a fixed graph in a random graph or multigraph, for various models of random (multi)graphs. For our proofs we introduce the notion of \emph{patchworks} to describe the possible…
We propose a framework to study local gauge theories on manifolds with boundaries and asymptotic symmetries, which is based on representing them as so-called gauge PDEs. These objects extend the conventional BV-AKSZ sigma-models to the case…
Testing isomorphism of infinite groups is a classical topic, but from the complexity theory viewpoint, few results are known. S{\'e}nizergues and the fifth author (ICALP2018) proved that the isomorphism problem for virtually free groups is…
We give a new proof for the local existence of a smooth isometric embedding of a smooth $3$-dimensional Riemannian manifold with nonzero Riemannian curvature tensor into $6$-dimensional Euclidean space. Our proof avoids the sophisticated…
We consider nonparametric testing in a non-asymptotic framework. Our statistical guarantees are exact in the sense that Type I and II errors are controlled for any finite sample size. Meanwhile, one proposed test is shown to achieve minimax…
In much discussed work Artemov has recently shown that, for $\mathrm{PA}$, the consistency schema admits a form of uniform verification via selector proofs, despite the unprovability of the corresponding uniform consistency sentence…
Symmetry packaging is the phenomenon whereby, upon particle creation, all the internal quantum numbers (IQNs) become locked into a single irreducible representation (irrep) block of the gauge group, as required by locality and gauge…
A simple skew-symmetric Nitsche's formulation is introduced into the framework of isogeometric analysis (IGA) to deal with various problems in small strain elasticity: essential boundary conditions, symmetry conditions for Kirchhoff plates,…
Building on work of Cai, F\"urer, and Immerman \cite{CFI92}, we show two hardness results for the Graph Isomorphism problem. First, we show that there are pairs of nonisomorphic $n$-vertex graphs $G$ and $H$ such that any sum-of-squares…
The concept of an $i$-symmetrization is introduced, which provides a convenient framework for most of the familiar symmetrization processes on convex sets. Various properties of $i$-symmetrizations are introduced and the relations between…
As it follows from G\"odel's incompleteness theorems, any consistent formal system of axioms and rules of inference should imply a true unprovable statement. Actually, this fundamental principle can be efficiently applicable in…
The construction of a theory of quantum gravity is an outstanding problem that can benefit from better understanding the laws of nature that are expected to hold in regimes currently inaccessible to experiment. Such fundamental laws can be…
The Gromov-Wasserstein (GW) distance enables comparing metric measure spaces based solely on their internal structure, making it invariant to isomorphic transformations. This property is particularly useful for comparing datasets that…
In Grochow and Qiao (SIAM J. Comput., 2021), the complexity class Tensor Isomorphism (TI) was introduced and isomorphism problems for groups, algebras, and polynomials were shown to be TI-complete. In this paper, we study average-case…
The Densest Subgraph Problem (DSP) is widely used to identify community structures and patterns in networks such as bioinformatics and social networks. While solvable in polynomial time, traditional exact algorithms face computational and…
A classic result due to Schaefer (1978) classifies all constraint satisfaction problems (CSPs) over the Boolean domain as being either in $\mathsf{P}$ or $\mathsf{NP}$-hard. This paper considers a promise-problem variant of CSPs called…
The problem of finding an appropriate geometrical/physical index for measuring a degree of inhomogeneity for a given space-time manifold is posed. Interrelations with the problem of understanding the gravitational/informational entropy are…
Symmetry plays a fundamental role in understanding natural phenomena and mathematical structures. This work develops a comprehensive theory for studying the persistent symmetries and degree of asymmetry of finite point configurations over…
Statistically sound crystallographic symmetry classifications are obtained with information theory based methods in the presence of approximately Gaussian distributed noise. A set of three synthetic images with very strong Fedorov type…