Related papers: On Symmetric Circuits and Fixed-Point Logics
We consider an involutive automorphism of the conformal algebra and the resulting symmetric space. We display a new action of the conformal group which gives rise to this space. The space has an intrinsic symplectic structure, a…
Inhomogeneities and junctions in wires are natural sources of scattering, and hence resistance. A conducting fixed point usually requires an adiabatically smooth system. One notable exception is "healing", which has been predicted in…
Conventional logic and memory devices are built out of deterministic units such as transistors, or magnets with energy barriers in excess of 40-60 kT. We show that stochastic units, p-bits, can be interconnected to create robust…
Treating neural network inputs and outputs as random variables, we characterize the structure of neural networks that can be used to model data that are invariant or equivariant under the action of a compact group. Much recent research has…
Controlled commands -- computations whose execution depends on a separate input -- play a central role in reversible Boolean circuits and quantum circuits. However, existing formalisms typically treat control only implicitly, entangled with…
Local-order-invariant (first-order) logic is an extension of first-order logic where formulae have access to a ternary local order relation on the Gaifman graph, provided that the truth value does not depend on the specific order relation…
One of the key aspects in component-based design is specifying the software architecture that characterizes the topology and the permissible interactions of the components of a system. To achieve well-founded design there is need to address…
Given a family of groups admitting a braided monoidal structure (satisfying mild assumptions) we construct a family of spaces on which the groups act and whose connectivity yields, via a classical argument of Quillen, homological stability…
In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…
The quantum mechanics of superconducting circuits is derived by starting from a classical Hamiltonian dynamical system describing a dissipationless circuit, usually made of capacitive and inductive elements. However, standard approaches to…
The classification of electron systems according to their topology has been at the forefront of condensed matter research in recent years. It has been found that systems of the same symmetry, previously thought of as equivalent, may in fact…
In this paper, we are interested in the number of fixed points of functions $f:A^n\to A^n$ over a finite alphabet $A$ defined on a given signed digraph $D$. We first use techniques from network coding to derive some lower bounds on the…
Different Boolean networks may reveal similar dynamics although their definition differs, then preventing their distinction from the observations. This raises the question about the sufficiency of a particular Boolean network for properly…
We study the synchronous and asynchronous automatic structures on the fundamental group of a graph of groups in which each edge group is finite. Up to a natural equivalence relation, the set of biautomatic structures on such a graph product…
We study deterministic and quantum dynamics from a constructive "finite" point of view, since the introduction of a continuum, or other actual infinities in physics poses serious conceptual and technical difficulties, without any need for…
Schreier graphs, which possess both a graph structure and a Schreier structure (an edge-labeling by the generators of a group), are objects of fundamental importance in group theory and geometry. We study the Schreier structures with which…
Circuit quantization is an extraordinarily successful theory that describes the behavior of quantum circuits with high precision. The most widely used approach of circuit quantization relies on introducing a classical Lagrangian whose…
Traditionally, graph algorithms get a single graph as input, and then they should decide if this graph satisfies a certain property $\Phi$. What happens if this question is modified in a way that we get a possibly infinite family of graphs…
Congruences, or $2$-parameter families of lines in $3$-space are of interest in many situations, in particular in geometric optics. In this paper we consider elements of their geometry which are invariant under affine changes of…
We introduce a logical foundation to reason on tree structures with constraints on the number of node occurrences. Related formalisms are limited to express occurrence constraints on particular tree regions, as for instance the children of…