Related papers: Symmetric Proofs in the Ideal Proof System
Handsome proof nets were introduced by Retor\'e as a syntax for multiplicative linear logic. These proof nets are defined by means of cographs (graphs representing formulas) equipped with a vertices partition satisfying simple topological…
We discuss W-symmetries of Ito stochastic differential equations, introduced in a recent paper by Gaeta and Spadaro [J. Math. Phys. 2017]. In particular, we discuss the general form of acceptable generators for continuous (Lie-point)…
Most state-of-the-art satisfiability algorithms today are variants of the DPLL procedure augmented with clause learning. The main bottleneck for such algorithms, other than the obvious one of time, is the amount of memory used. In the field…
In this thesis, the symmetry structure of gravitational theories at null infinity is studied further, in the case of pure gravity in four dimensions and also in the case of Einstein-Yang-Mills theory in $d$ dimensions with and without a…
We introduce the \emph{idemetric} property, which formalises the idea that most nodes in a graph have similar distances between them, and which turns out to be quite standard amongst small-world network models. Modulo reasonable sparsity…
The presence of symmetries imposes a stringent set of constraints on a system. This constrained structure allows intelligent agents interacting with such a system to drastically improve the efficiency of learning and generalization, through…
Correlation analysis is a fundamental problem in statistics. In this paper, we consider the correlation detection problem between a pair of Erdos-Renyi graphs. Specifically, the problem is formulated as a hypothesis testing problem: under…
We propose a novel way of generalizing the class of interval graphs, via a graph width parameter called the simultaneous interval number. This parameter is related to the simultaneous representation problem for interval graphs and defined…
We prove a rigidity theorem that shows that, under many circumstances, quasi-isometric embeddings of equal rank, higher rank symmetric spaces are close to isometric embeddings. We also produce some surprising examples of quasi-isometric…
Eisermann and Lamm introduced a notion of symmetric equivalence among symmetric union diagrams and studied it using a refined form of the Jones polynomial. We introduced invariants of symmetric equivalence via refined versions of…
We propose a Symmetry Topological Field Theory (SymTFT) for continuous spacetime symmetries. For a $d$-dimensional theory, it is given by a $(d+1)$-dimensional BF-theory for the spacetime symmetry group, and whenever $d$ is even, it can…
Sign-Perturbed Sum (SPS) is a powerful finite-sample system identification algorithm which can construct confidence regions for the true data generating system with exact coverage probabilities, for any finite sample size. SPS was developed…
The symmetry of complex networks is a global property that has recently gained attention since MacArthur et al. 2008 showed that many real-world networks contain a considerable number of symmetries. These authors work with a very strict…
The real symplectic Stiefel manifold is the manifold of symplectic bases of symplectic subspaces of a fixed dimension. It features in a large variety of applications in physics and engineering. In this work, we study this manifold with the…
We study the complexity of the Graph Isomorphism problem on graph classes that are characterized by a finite number of forbidden induced subgraphs, focusing mostly on the case of two forbidden subgraphs. We show hardness results and develop…
In 1991, Yannakakis (J. Comput. System Sci., 1991) proved that no symmetric extended formulation for the matching polytope of the complete graph K_n with n nodes has a number of variables and constraints that is bounded subexponentially in…
The constraint satisfaction problem (CSP) can be formulated as a homomorphism problem between relational structures: given a structure $\mathcal{A}$, for any structure $\mathcal{X}$, whether there exists a homomorphism from $\mathcal{X}$ to…
In this paper we develop a new approach for studying overlapping iterated function systems. This approach is inspired by a famous result due to Khintchine from Diophantine approximation. This result shows that for a family of limsup sets,…
Asymptotic symmetries in Carrollian gravitational theories in 3+1 space and time dimensions obtained from "magnetic" and "electric" ultrarelativistic contractions of General Relativity are analyzed. In both cases, parity conditions are…
We develop a theory for the existence of perfect matchings in hypergraphs under quite general conditions. Informally speaking, the obstructions to perfect matchings are geometric, and are of two distinct types: 'space barriers' from convex…