Related papers: A Logspace Constructive Proof of L=SL

We define an $ sl(N) $ analog of Onsager's Algebra through a finite set of relations that generalize the Dolan Grady defining relations for the original Onsager's Algebra. This infinite-dimensional Lie Algebra is shown to be isomorphic to a…

We give a new short proof that the wheeled operad of unimodular Lie algebras is Koszul and use this to explicitly construct its minimal resolution. A representation of this resolution in a finite dimensional vector space V we call a…

Reinforcement learning is critical to improving large reasoning models, but its success relies heavily on verifiable rewards (RLVR), making it hard to use in open-ended domains where correctness is ambiguous and cannot be verified.…

For logarithmic conformal field theories whose monodromy data is given by a not necessarily semisimple modular category, we solve the problem of constructing and classifying the consistent systems of correlators. The correlator construction…

An orthogonal representation of a graph is an assignment of nonzero real vectors to its vertices such that distinct non-adjacent vertices are assigned to orthogonal vectors. We prove general lower bounds on the dimension of orthogonal…

Standpoint linear temporal logic SLTL is a recent formalism able to model possibly conflicting commitments made by distinct agents, taking into account aspects of temporal reasoning. In this paper, we analyse the computational properties of…

Let $M$ be a 1-connected closed manifold and $LM$ be the space of free loops on $M$. In \cite{C-S} M. Chas and D. Sullivan defined a structure of BV-algebra on the singular homology of $LM$, $H_\ast(LM; \bk)$. When the field of coefficients…

Kontsevich's formality theorem states that the differential graded Lie algebra of multidifferential operators on a manifold M is L-infinity-quasi-isomorphic to its cohomology. The construction of the L-infinity map is given in terms of…

We study the local preservation of Birkhoff-James orthogonality by linear operators between normed linear spaces, at a point and in a particular direction. We obtain a complete characterization of the same, which allows us to present…

Let $M$ be a smooth projective variety and $\mathbf{D}$ an ample normal crossings divisor. From topological data associated to the pair $(M, \mathbf{D})$, we construct, under assumptions on Gromov-Witten invariants, a series of…

We propose a graph-based extension of Boolean logic called Boolean Graph Logic (BGL). Construing formula trees as the cotrees of cographs, we may state semantic notions such as evaluation and entailment in purely graph-theoretic terms,…

In this paper we systematically investigate the connections between logics with a finite number of variables, structures of bounded pathwidth, and linear Datalog Programs. We prove that, in the context of Constraint Satisfaction Problems,…

One of the central open questions in bounded arithmetic is whether Buss' hierarchy of theories of bounded arithmetic collapses or not. In this paper, we reformulate Buss' theories using free logic and conjecture that such theories are…

In this paper, we show that theory of processes can be reduced to the theory of spatial logic. Firstly, we propose a spatial logic SL for higher order pi-calculus, and give an inference system of SL. The soundness and incompleteness of SL…

Let $V$ be a braided vector space of diagonal type. Let $\mathfrak B(V)$, $\mathfrak L^-(V)$ and $\mathfrak L(V)$ be the Nichols algebra, Nichols Lie algebra and Nichols braided Lie algebra over $V$, respectively. We show that a monomial…

We extend first-order logic with counting by a new operator that allows it to formalise a limited form of recursion which can be evaluated in logarithmic space. The resulting logic LREC has a data complexity in LOGSPACE, and it defines…

The fixed-point logic LREC= was developed by Grohe et al. (CSL 2011) in the quest for a logic to capture all problems decidable in logarithmic space. It extends FO+C, first-order logic with counting, by an operator that formalises a limited…

This work is dedicated to the construction of a new motivic homotopy theory for (log) schemes, generalizing Morel-Voevodsky's (un)stable $\mathbb{A}^1$-homotopy category. Our framework can be used to represent log topological Hochschild and…

We present QBAL, an extension of Girard, Scedrov and Scott's bounded linear logic. The main novelty of the system is the possibility of quantifying over resource variables. This generalization makes bounded linear logic considerably more…

In this paper we give a new proof of the Ne\v{s}et\v{r}il-R\"odl Theorem, a deep result of discrete mathematics which is one of the cornerstones of the structural Ramsey theory. In contrast to the well-known proofs which employ intricate…