Related papers: The \mu-Calculus Alternation Hierarchy Collapses o…
A conjecture in algorithmic model theory predicts that the model-checking problem for first-order logic is fixed-parameter tractable on a hereditary graph class if and only if the class is monadically dependent. Originating in model theory,…
Coherence theorems for covariant structures carried by a category have traditionally relied on the underlying term rewriting system of the structure being terminating and confluent. While this holds in a variety of cases, it is not a…
Compactifications of heterotic M-theory are shown to provide solutions to the weak- and axion-scale hierarchy problems as a consequence of warped large extra dimensions. They allow a description that is reminiscent of the so-called…
Kirkpatrick et al. [ALT 2019] and Fallat et al. [JMLR 2023] introduced non-clashing teaching and proved that it is the most efficient batch machine teaching model satisfying the collusion-avoidance benchmark established in the seminal work…
We use monadic second-order logic to define two-dimensional subshifts, or sets of colorings of the infinite plane. We present a natural family of quantifier alternation hierarchies, and show that they all collapse to the third level. In…
We consider partially ordered sets of combinatorial structures under consecutive orders, meaning that two structures are related when one embeds in the other such that `consecutive' elements remain consecutive in the image. Given such a…
Indexed languages are a classical notion in formal language theory, which has attracted attention in recent decades due to its role in higher-order model checking: They are precisely the languages accepted by order-2 pushdown automata. The…
An elastic arch is an archetypal bistable system. Here, we combine elastica theory and photo-mechanical experiments to elucidate the mechanics of an active arch with a spatio-temporally varying preferred curvature $\overline \kappa(s)$. Our…
Given two arbitrary closed sets in Euclidean space, a simple transversality condition guarantees that the method of alternating projections converges locally, at linear rate, to a point in the intersection. Exact projection onto nonconvex…
Our earlier work titled: "Win-move is Coordination-Free (Sometimes)" has shown that the classes of queries that can be distributedly computed in a coordination-free manner form a strict hierarchy depending on the assumptions of the model…
A graph is said to be {\em half-arc-transitive} if its automorphism group acts transitively on the set of its vertices and edges but not on the set of its arcs. With each half-arc-transitive graph of valency 4 a collection of the so called…
An extensive study of the compact $U(1)$ lattice gauge theory with a higher derivative gauge-fixing term and a suitable counter-term has been undertaken to determine the nature of the possible continuum limits for a wide range of the…
Canonical abstraction is a static analysis technique that represents states as 3-valued logical structures, and produces finite abstract systems. Despite providing a finite bound, these abstractions may still suffer from the state explosion…
We investigate several categories related to transition structures, using a mixture of algebraic and topological methods. We show how two such categories are connected by a contravariant adjunction. This is the most detailed of a family of…
A well-known open problem on the behavior of optimal paths in random graphs in the strong disorder regime, formulated by statistical physicists, and supported by a large amount of numerical evidence over the last decade [31,32,38,70] is as…
The quest for Continual Learning (CL) seeks to empower neural networks with the ability to learn and adapt incrementally. Central to this pursuit is addressing the stability-plasticity dilemma, which involves striking a balance between two…
Graph matching consists of aligning the vertices of two unlabeled graphs in order to maximize the shared structure across networks; when the graphs are unipartite, this is commonly formulated as minimizing their edge disagreements. In this…
Alignment, the tendency of adjacent weight matrices in deep networks to develop compatible subspace orientations, underlies gradient flow, Neural Collapse, and representation similarity across architectures. Despite extensive empirical…
Variational quantum algorithms dominate gate-based applications of modern quantum processors. The so called, {\it layer-wise trainability conjecture} appears in various works throughout the variational quantum computing literature. The…
We propose a new vertex formalism, called anti-refined topological vertex (anti-vertex for short), to compute the generalized topological string amplitude, which gives rise to the supergroup gauge theory partition function. We show the…