Related papers: Bilattice-Catastrophe Isomorphism for Four-Valued …
Stone-type dualities provide a powerful mathematical framework for studying properties of logical systems. They have recently been fruitfully explored in understanding minimisation of various types of automata. In Bezhanishvili et al.…
Is it possible for an anisotropic Lifshitz critical point to actually exhibit isotropic conformal invariance? We answer this question in the affirmative by constructing a concrete holographic realization. We study three-dimensional spin-3…
Full Intuitionistic Linear Logic (FILL) is multiplicative intuitionistic linear logic extended with par. Its proof theory has been notoriously difficult to get right, and existing sequent calculi all involve inference rules with complex…
Quantum general relativity may be considered as generally covariant QFT on differentiable manifolds, without any a priori metric structure. The kinematically covariance group acts by general diffeomorphisms on the manifold and by…
Bilinear systems emerge in a wide variety of fields as natural models for dynamical systems ranging from robotics to quantum dots. Analyzing controllability of such systems is of fundamental and practical importance, for example, for the…
Finite-domain constraint satisfaction problems are either solvable by Datalog, or not even expressible in fixed-point logic with counting. The border between the two regimes coincides with an important dichotomy in universal algebra; in…
For a rank 1 local system on the complement of a reduced divisor on a complex manifold $X$, its cohomology is calculated by the twisted meromorphic de Rham complex. Assuming the divisor is everywhere positively weighted homogeneous, we…
This paper studies a slow-fast system whose principal characteristic is that the slow manifold is given by the critical set of the cusp catastrophe. Our analysis consists of two main parts: first, we recall a formal normal form suitable for…
The Lorentz-violating isotropic modified Maxwell theory minimally coupled to standard Dirac theory is characterized by a single real dimensionless parameter which is taken to vanish for the case of the standard (Lorentz-invariant) theory. A…
We introduce graphical complexes of groups, which can be thought of as a generalisation of Coxeter systems with 1-dimensional nerves. We show that these complexes are strictly developable, and we equip the resulting Basic Construction with…
Despite spectacular advances in defining invariants for simply connected smooth and symplectic 4-dimensional manifolds and the discovery of effective surgical techniques, we still have been unable to classify simply connected smooth…
Recent advances in multimodal large language models (LLMs) have shown extreme effectiveness in visual question answering (VQA). However, the design nature of these end-to-end models prevents them from being interpretable to humans,…
In sphere of research of discrete optimization algorithms efficiency the important place occupies a method of polynomial reducibility of some problems to others with use of special purpose components. In this paper a novel method of compact…
We discuss the problem of finding non-trivial invariants of non-deterministic, symmetric cut-reduction procedures in the classical sequent calculus. We come to the conclusion that (an enriched version of) the propositional fragment of GS4…
Given a three-valued definition of validity, which choice of three-valued truth tables for the connectives can ensure that the resulting logic coincides exactly with classical logic? We give an answer to this question for the five monotonic…
We show that if we enrich first order logic by allowing quantification over isomorphisms between definable ordered fields the resulting logic, L(Q_{Of}), is fully compact. In this logic, we can give standard compactness proofs of various…
Distributed systems are critical to reliable and scalable computing; however, they are complicated in nature and prone to bugs. To modularly manage this complexity, network middleware has been traditionally built in layered stacks of…
We propose a new bi-intuitionistic type theory called Dualized Type Theory (DTT). It is a simple type theory with perfect intuitionistic duality, and corresponds to a single-sided polarized sequent calculus. We prove DTT strongly…
Valiant's conjecture asserts that the circuit complexity classes VP and VNP are distinct, meaning that the permanent does not admit polynomial-size algebraic circuits. As it is the case in many branches of complexity theory, the…
The Constraint Satisfaction Problem (CSP) and its counting counterpart appears under different guises in many areas of mathematics, computer science, and elsewhere. Its structural and algorithmic properties have demonstrated to play a…