Related papers: Duality, Reconstruction, and Structural Toolkit Th…
Cubical type theories are designed around an abstract unit interval from which types of paths, used to represent equalities, are defined. Varying the operations available on this interval yields different type theories. A reversal is an…
It has been proposed recently that interacting Symmetry Protected Topological (SPT) phases can be classified using cobordism theory. We test this proposal in the case of fermionic SPT phases with Z/2 symmetry, where Z/2 is either…
Automated Theorem Proving (ATP) deals with the development of computer programs being able to show that some conjectures (queries) are a logical consequence of a set of axioms (facts and rules). There exists several successful ATPs where…
In various subjects including mathematics, one can hope to use mathematical thinking well when the right kinds of algebraic structure to consider can be discovered or spotted. Therefore, it would help to understand kinds of algebraic…
A deductive system is structurally complete if its admissible inference rules are derivable. For several important systems, like modal logic S5, failure of structural completeness is caused only by the underivability of passive rules, i.e.…
In the classically unbroken phase, 3d $O(N)$ symmetric $\phi^4$ vector models admit two equivalent descriptions connected by a strong-weak duality closely related to the one found by Chang and Magruder long ago. We determine the exact…
Abstract algebra provides a large hierarchy of properties that a collection of objects can satisfy, such as forming an abelian group or a semiring. These classifications can arranged into a broad and typically acyclic directed graph. This…
Binary representation is desirable for its memory efficiency, computation speed and robustness. In this paper, we propose adjustable bounded rectifiers to learn binary representations for deep neural networks. While hard constraining…
We introduce a framework to define coalgebra and bialgebra structures on two-dimensional (2D) square lattices, extending the algebraic theory of Hopf algebras and quantum groups beyond the one-dimensional (1D) setting. Our construction is…
Large-eddy simulations of a flat-plate boundary layer, without a leading edge, subject to multiple levels of incoming free stream turbulence are considered in the present work. Within an input-output model where non-linear terms of the…
We use the Symmetry Topological Field Theory (SymTFT) to systematically characterize gapped phases in 2+1 dimensions with categorical symmetries. The SymTFTs that we consider are (3+1)d Dijkgraaf-Witten (DW) theories for finite groups $G$,…
We propose a generalized protocol for constructing a dual free bulk theory from any boundary model of generalized free fields (GFFs). To construct the bulk operators, we employ a linear ansatz similar to the Hamilton-Kabat-Liftschytz and…
This paper contributes to the Alpay Algebra by demonstrating that the stable outcome of a self referential process, obtained by iterating a transformation through all ordinal stages, is identical to the unique equilibrium of an unbounded…
Given two distinct subsets $A,B$ in the state space of some dynamical system, Transition Path Theory (TPT) was successfully used to describe the statistical behavior of transitions from $A$ to $B$ in the ergodic limit of the stationary…
Time-dependent density functional theory is widely used to describe excitations of many-fermion systems. In its many applications, 3D coordinate-space representation is used, and infinite-domain calculations are limited to a finite volume…
We analyze loop-induced group-like symmetries in theories where fields are labeled by basis elements of a fusion algebra constructed from the conjugacy classes of finite groups. Although the fusion rules for conjugacy classes are in general…
In two-dimensional conformal field theory, we analyze conformally invariant boundary conditions which break part of the bulk symmetries. When the subalgebra that is preserved by the boundary conditions is the fixed algebra under the action…
We present a systematic topological classification of fermionic and bosonic topological phases protected by time-reversal, particle-hole, parity, and combination of these symmetries. We use two complementary approaches: one in terms of…
Constructing complex computation from simpler building blocks is a defining problem of computer science. In algebraic automata theory, we represent computing devices as semigroups. Accordingly, we use mathematical tools like products and…
To preserve previously learned representations, continual learning systems must strike a balance between plasticity, the ability to acquire new knowledge, and stability. This stability-plasticity dilemma affects how representations can be…