Related papers: Symmetric Proofs in the Ideal Proof System
We describe the Fundamental Theorem on Symmetric Polynomials (FTSP), exposit a classical proof, and offer a novel proof that arose out of an informal course on group theory. The paper develops this proof in tandem with the pedagogical…
This thesis aims to establish notions of symmetry for quantum states and channels as well as describe algorithms to test for these properties on quantum computers. Ideally, the work will serve as a self-contained overview of the subject. We…
Symmetry is a unifying concept in physics. In quantum information and beyond, it is known that quantum states possessing symmetry are not useful for certain information-processing tasks. For example, states that commute with a Hamiltonian…
It is confirmed in this work that the graph isomorphism can be tested in polynomial time, which resolves a longstanding problem in the theory of computation. The contributions are in three phases as follows. 1. A description graph…
We consider the problem of satisfiability of sets of constraints in a given set of finite uniform hypergraphs. While the problem under consideration is similar in nature to the problem of satisfiability of constraints in graphs, the…
The graph is one of the most widely used mathematical structures in engineering and science because of its representational power and inherent ability to demonstrate the relationship between objects. The objective of this work is to…
This paper proposes a characterization of when one axiomatic theory, as a proof system for tautologies, $p$-simulates another, by showing: (i)~if c.e. theory $\mathcal{S}$ efficiently interprets $\mathcal{S}{+}\phi$, then $\mathcal{S}$…
The complexity of the graph isomorphism problem for trapezoid graphs has been open over a decade. This paper shows that the problem is GI-complete. More precisely, we show that the graph isomorphism problem is GI-complete for comparability…
Symmetry topological field theory (SymTFT), or topological holography, offers a unifying framework for describing quantum phases of matter and phase transitions between them. While this approach has seen remarkable success in describing…
Extraction of structure, in particular of group symmetries, is increasingly crucial to understanding and building intelligent models. In particular, some information-theoretic models of parsimonious learning have been argued to induce…
We establish topological necessary and sufficient conditions under which a pair of statistical hypotheses can be consistently distinguished when i.i.d. observations are recorded only to finite precision. To accommodate finite-precision…
Anomaly matching for continuous symmetries has been the primary tool for establishing symmetry enforced gaplessness - the phenomenon where global symmetry alone forces a quantum system to be gapless in the infrared. We introduce a new…
A fundamental result in the study of graph homomorphisms is Lov\'asz's theorem that two graphs are isomorphic if and only if they admit the same number of homomorphisms from every graph. A line of work extending Lov\'asz's result to more…
Model checking is the process of deciding whether a system satisfies a given specification. Often, when the setting comprises multiple processes, the specifications are over sets of input and output signals that correspond to individual…
We survey recent progress in the proof complexity of strong proof systems and its connection to algebraic circuit complexity, showing how the synergy between the two gives rise to new approaches to fundamental open questions, solutions to…
This thesis is dedicated to the study of symmetries in reduced models of gravity, with some frozen degrees of freedom. We focus on the minisuperspace reduction whith a finite number of degrees of freedom. Minisuperspaces are treated as…
Symmetry topological field theory (SymTFT) is a convenient tool for studying finite generalized symmetries of a given quantum field theory (QFT). In particular, SymTFTs encode all the symmetry structures and properties, including anomalies.…
A computer program is introduced, which allows to determine statistically optimal approxi-mation using the "Asymptotic Parabola" fit, or, in other words, the spline consisting of polynomials of order 1,2,1, or two lines ("asymptotes")…
This paper proposes a class of origin-smooth approximators of indicators underlying the sum-of-negative-part statistic for testing multiple inequalities. The need for simulation or bootstrap to obtain test critical values is thereby…
The existence of a (p-)optimal propositional proof system is a major open question in (proof) complexity; many people conjecture that such systems do not exist. Krajicek and Pudlak (1989) show that this question is equivalent to the…