Related papers: Symmetric Proofs in the Ideal Proof System
The proof of information inequalities and identities under linear constraints on the information measures is an important problem in information theory. For this purpose, ITIP and other variant algorithms have been developed and…
The graph isomorphism problem looks deceptively simple, but although polynomial-time algorithms exist for certain types of graphs such as planar graphs and graphs with bounded degree or eigenvalue multiplicity, its complexity class is still…
We discuss spherically symmetric perfect fluid solutions of Einstein's equations which have equation of state ($p=\alpha \mu$) and which are self-similar in the sense that all dimensionless variables depend only upon $z\equiv r/t$. For each…
The CSP (constraint satisfaction problems) is a class of problems deciding whether there exists a homomorphism from an instance relational structure to a target one. The CSP dichotomy is a profound result recently proved by Zhuk (2020, J.…
The graph isomorphism (GI) problem, which asks whether two graphs are structurally identical, occupies a unique position in computational complexity -- it is neither known to be solvable in polynomial time, nor proven to be NP-complete. We…
Frames provide redundant, stable representations of data which have important applications in signal processing. We introduce a connection between symplectic geometry and frame theory and show that many important classes of frames have…
This paper examines the asymptotic convergence properties of Lipschitz interpolation methods within the context of bounded stochastic noise. In the first part of the paper, we establish probabilistic consistency guarantees of the classical…
Combining the the results of A.R. Meyer and L.J. Stockmeyer "The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space", and K.S. Booth "Isomorphism testing for graphs, semigroups, and finite automata are…
The contour argument was introduced by Peierls for two dimensional Ising model. Peierls benefited from the particular symmetries of the Ising model. For non-symmetric models the argument was developed by Pirogov and Sinai. It is very…
We prove that "first singularities" in the non-trapped region of the maximal development of spherically symmetric asymptotically flat data for the Einstein-Vlasov system must necessarily emanate from the center. The notion of "first"…
The presented material is devoted to the equivalent conversion from the vertex graphs to the edge graphs. We suggest that the proved theorems solve the problem of the isomorphism of graphs, the problem of the graph's enumeration with the…
Asymptotic symmetries of AdS$_4$ quantum gravity and gauge theory are derived by coupling the dual CFT$_3$ to Chern-Simons gauge theory and 3D gravity in a "probe" large-level limit. The infinite-dimensional symmetries are shown to arise…
We study the complexity of proving that a sparse random regular graph on an odd number of vertices does not have a perfect matching, and related problems involving each vertex being matched some pre-specified number of times. We show that…
Symmetry plays a crucial role in understanding the properties of mathematical structures and optimization problems. Recent work has explored this phenomenon in the context of neural networks, where the loss function is invariant under…
We show that the problem to decide whether two (convex) polytopes, given by their vertex-facet incidences, are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a…
Our starting point is the observation that if graphs in a class C have low descriptive complexity in first order logic, then the isomorphism problem for C is solvable by a fast parallel algorithm (essentially, by a simple combinatorial…
These notes are an introduction to asymptotic symmetries in gauge theories, with a focus on general relativity in four dimensions. We explain how to impose consistent sets of boundary conditions in the gauge fixing approach and how to…
We introduce a method for proving Sum-of-Squares (SoS)/ Lasserre hierarchy lower bounds when the initial problem formulation exhibits a high degree of symmetry. Our main technical theorem allows us to reduce the study of the positive…
Several hypothesis testing methods have been proposed to validate the assumption of isotropy in spatial point patterns. A majority of these methods are characterised by an unknown distribution of the test statistic under the null hypothesis…
We consider two variants of the induced subgraph isomorphism problem for two independent binomial random graphs with constant edge-probabilities p_1,p_2. In particular, (i) we prove a sharp threshold result for the appearance of G_{n,p_1}…