Related papers: A Complete Inference System for Skip-free Guarded …
We develop a fully diagrammatic approach to finite-state automata, based on reinterpreting their usual state-transition graphical representation as a two-dimensional syntax of string diagrams. In this setting, we are able to provide a…
Given an algebraic torus action on a normal projective variety with finitely generated total coordinate ring, we study the GIT-equivalence for not necessarily ample linearized divisors, and we provide a combinatorial description of the…
We present a robust scheme to derive effective models non-perturbatively for quantum lattice models when at least one degree of freedom is gapped. A combination of graph theory and the method of continuous unitary transformations (gCUTs) is…
Proposed is a program for what we call Geometric Arithmetic, based on our works on non-abelian zeta functions and non-abelian class field theory. Key words are stability and adelic intersection-cohomology theory.
Modern software is constantly changing. Researchers and practitioners are increasingly aware that verification tools can be impactful if they embrace change through analyses that are compositional and span program versions. Reasoning about…
We confirm a conjecture by Lekili and Polishchuk that the geometric invariants which they construct for homologically smooth graded (not necessarily proper) gentle algebras form a complete derived invariant. Hence, we obtain a complete…
In this paper, we study the algebraic analogue of the topological Atiyah-Segal completion theorem. We verify this completion theorem for the algebraic equivariant $K$-theory of smooth projective schemes. We also show that the completion…
Full-sampling (e.g., Q-learning) and pure-expectation (e.g., Expected Sarsa) algorithms are efficient and frequently used techniques in reinforcement learning. Q$(\sigma,\lambda)$ is the first approach unifies them with eligibility trace…
Rule-based models are often used for data analysis as they combine interpretability with predictive power. We present RuleKit, a versatile tool for rule learning. Based on a sequential covering induction algorithm, it is suitable for…
One challenge in fact checking is the ability to improve the transparency of the decision. We present a fact checking method that uses reference information in knowledge graphs (KGs) to assess claims and explain its decisions. KGs contain a…
In this paper, we introduce a proof system $\mathsf{NQGL}$ for a Kripke complete predicate extension of the logic $\mathbf{GL}$, that is, the logic of provability, which is defned by $\mathbf{K}$ and the L\"{o}b formula $\Box(\Box p\supset…
Classical results in computability theory, notably Rice's theorem, focus on the extensional content of programs, namely, on the partial recursive functions that programs compute. Later and more recent work investigated intensional…
We establish a criterion for when an abelian extension of infinite-dimensional Lie algebras integrates to a corresponding Lie group extension $\hat{G}$ of $G$ by $A$, where $G$ is a connected, simply connected Lie group and $A$ is a…
We investigate a construction of a pseudo BL-algebra out of an $\ell$-group called a kite. We show that many well-known examples of algebras related to fuzzy logics can be obtained in that way. We describe subdirectly irreducible kites. As…
The class of all $\ast$-continuous Kleene algebras, whose description includes an infinitary condition on the iteration operator, plays an important role in computer science. The complexity of reasoning in such algebras - ranging from the…
In this paper, we present a systematic way of deriving (1) languages of (generalised) regular expressions, and (2) sound and complete axiomatizations thereof, for a wide variety of systems. This generalizes both the results of Kleene (on…
Discrete mathematics is the foundation of computer science. It focuses on concepts and reasoning methods that are studied using math notations. It has long been argued that discrete math is better taught with programming, which takes…
Since the work of Mikhail Kapranov in [Kap], it is known that the shifted tangent complex $\mathbb{T}_X[-1]$ of a smooth algebraic variety $X$ is endowed with a weak Lie structure. Moreover any complex of quasi-coherent sheaves on $X$ is…
As large language models (LLMs) advance, their role in higher education, particularly in free-response problem-solving, requires careful examination. This study assesses the performance of GPT-4o and o1-preview under realistic educational…
Previous studies have typically assumed that large language models are unable to accurately perform arithmetic operations, particularly multiplication of >8 digits, and operations involving decimals and fractions, without the use of…