Related papers: Implementing Anti-Unification Modulo Equational Th…
We survey some of the stratification theorems concerning exponential sums over finite fields, especially those due to Katz-Laumon and Fouvry-Katz, as well as some of their applications. Moreover, motivated partly by recent work of Bonolis,…
We present a novel end-to-end reinforcement learning approach to automatic taxonomy induction from a set of terms. While prior methods treat the problem as a two-phase task (i.e., detecting hypernymy pairs followed by organizing these pairs…
This paper explores the application of automated planning to automated theorem proving, which is a branch of automated reasoning concerned with the development of algorithms and computer programs to construct mathematical proofs. In…
We present a novel automata-based approach to address linear temporal logic modulo theory (LTL-MT) as a specification language for data words. LTL-MT extends LTL_f by replacing atomic propositions with quantifier-free multi-sorted…
The linearisation of a second-order formulation of the conformal Einstein field equations (CEFEs) in Generalised Harmonic Gauge (GHG), with trace-free matter is derived. The linearised equations are obtained for a general background and…
We systematically apply semisimplification functors in modular representation theory. Motivated by the Duflo--Serganova functor in Lie superalgebras, we construct various functors of interest. In the setting of finite groups, we refine the…
Equational unification of two terms consists of finding a substitution that, when applied to both terms, makes them equal modulo some equational properties. Equational unification is of special relevance to automated deduction, theorem…
We introduce an approach that aims to combine the usage of satisfiability modulo theories (SMT) solvers with the Combinatory Logic Synthesizer (CL)S framework. (CL)S is a tool for the automatic composition of software components from a…
We prove a general factorization theorem for Lipschitz summing operators in the context of metric spaces which recovers several linear and nonlinear factorization theorems that have been proved recently in different environments. New…
In a former paper we proposed a model for the quantization of gravity by working in a bundle $E$ where we realized the Hamilton constraint as the Wheeler-DeWitt equation. However, the corresponding operator only acts in the fibers and not…
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are interpreted over constructor terms (representing data values),…
In 2003, Garunk\v{s}tis provided a lower bound for the lower density of the universality theorem for the Riemann zeta-function. In this paper, we generalize this result for the hybrid joint universality theorem for Dirichlet $L$-functions…
There appeared not long ago a Reduction Formula for derived Hochschild cohomology, that has been useful e.g., in the study of Gorenstein maps and of rigidity w.r.t. semidualizing complexes. The formula involves the relative dualizing…
We use the algebraic framework for languages of infinite trees introduced in [4] to derive effective characterisations of various temporal logics, in particular the logic EF (a fragment of CTL) and its counting variant cEF.
This paper introduces a novel anti-unification algorithm for the generalization of variadic structures with binders, designed as a flexible tool for structural code comparison. By combining nominal techniques for handling variable binding…
We introduce a new class of extensions of terms that consists in navigation strategies and insertion of contexts. We introduce an operation of combination on this class which is associative, admits a neutral element and so that each…
A key result in a 2004 paper by S. Arkhipov, R. Bezrukavnikov, and V. Ginzburg (ABG) gives an equivalence of the bounded derived category of finite dimensional modules for the principal block of a Lusztig quantum algebra at an $\ell^{th}$…
Many formal languages include binders as well as operators that satisfy equational axioms, such as commutativity. Here we consider the nominal language, a general formal framework which provides support for the representation of binders,…
In this paper we present equivalence results for several types of unbounded operator functions. A generalization of the concept equivalence after extension is introduced and used to prove equivalence and linearization for classes of…
These notes are based on a course given at the EPFL in May 2005. It is concerned with the representation theory of Hecke algebras in the non-semisimple case. We explain the role that these algebras play in the modular representation theory…