English
Related papers

Related papers: Implementing Anti-Unification Modulo Equational Th…

200 papers

In this document, we propose a description, via a Haskell implementation, of a generalization of the notion of regular expression allowing us to group the definitions and the methods of (tree or word) automata constructions over one generic…

Formal Languages and Automata Theory · Computer Science 2020-12-22 Ludovic Mignot

Sequence-to-sequence (SEQ2SEQ) models have been successfully applied to automatic math word problem solving. Despite its simplicity, a drawback still remains: a math word problem can be correctly solved by more than one equations. This…

Computation and Language · Computer Science 2018-11-16 Lei Wang , Yan Wang , Deng Cai , Dongxiang Zhang , Xiaojiang Liu

The paper contains an exposition of part of topology using partitions of unity. The main idea is to create variants of the Tietze Extension Theorem and use them to derive classical theorems. This idea leads to a new result generalizing…

General Topology · Mathematics 2008-02-28 Jerzy Dydak

Generalizing the theory of parity sheaves on complex algebraic stacks due to Juteau-Mautner-Williamson, we develop a theory of twisted equivariant parity sheaves. We use this formalism to construct a modular incarnation of Lusztig and Yun's…

Representation Theory · Mathematics 2026-04-20 Colton Sandvik

We present a generic tree-interpolation algorithm in the SMT context with quantifiers. The algorithm takes a proof of unsatisfiability using resolution and quantifier instantiation and computes interpolants (which may contain quantifiers).…

Logic in Computer Science · Computer Science 2023-05-22 Elisabeth Henkel , Jochen Hoenicke , Tanja Schindler

We prove the existence of a sequence of commutative diagrams generalizing existing results on the cohomology of the Borel-Serre boundary and well-rounded retract to the context of the well-tempered complex. Our main theorem provides a…

Number Theory · Mathematics 2025-10-21 Dylan Galt , Mark McConnell

Within the context of a $5D$ space-time, we construct a unified theory of gravity and electromagnetism from which the Einstein field equations and Maxwell equations emerge, with homogenous Maxwell equations appearing naturally. We also…

General Relativity and Quantum Cosmology · Physics 2010-06-17 A. Borzou , H. R. Sepangi

We introduce a categorical approach to classifying actions of C$^*$-tensor categories $\mathcal{C}$ on C$^*$-algebras up to cocycle conjugacy. We show that, in this category, inductive limits exist and there is a natural notion of…

Operator Algebras · Mathematics 2026-04-09 Sergio Girón Pacheco , Robert Neagu

An algebraic formalism, developped with V. Glaser and R. Stora for the study of the generalized retarded functions of quantum field theory, is used to prove a factorization theorem which provides a complete description of the generalized…

High Energy Physics - Theory · Physics 2016-04-27 Henri Epstein

The Homeomorphic Embedding relation has been amply used for defining termination criteria of symbolic methods for program analysis, transformation, and verification. However, homeomorphic embedding has never been investigated in the context…

Programming Languages · Computer Science 2018-11-29 María Alpuente , Angel Cuenca-Ortega , Santiago Escobar , José Meseguer

Different notions of equivalence, such as the prominent notions of strong and uniform equivalence, have been studied in Answer-Set Programming, mainly for the purpose of identifying programs that can serve as substitutes without altering…

Artificial Intelligence · Computer Science 2010-06-16 Michael Fink

We consider grammar-restricted exact learning of formulas and terms in finite variable logics. We propose a novel and versatile automata-theoretic technique for solving such problems. We first show results for learning formulas that…

Logic in Computer Science · Computer Science 2021-11-15 Paul Krogmeier , P. Madhusudan

Unified field theories act to merge the internal symmetries of the standard model into a single group. Here we lay out something different. That is, instead of aiming to unify the internal symmetries, we demonstrate a sense in which the…

High Energy Physics - Theory · Physics 2018-05-28 C. Furey

We first prove the following generalization of Schwarz lemma for harmonic mappings. Let $u$ be a harmonic mapping of the unit ball onto itself. Then we prove the inequality $\|u(x)-(1-\|x\|^2)/(1+\|x\|^2)^{n/2} u(0)\|\le U(|x| N)$. By using…

Analysis of PDEs · Mathematics 2015-05-19 David Kalaj

This is an introduction to linear algebra and group theory. We first review the linear algebra basics, namely the determinant, the diagonalization procedure and more, and with the determinant being constructed as it should, as a signed…

Combinatorics · Mathematics 2026-01-07 Teo Banica

This thesis is focused on techniques for finite automata and their use in practice, with the main emphasis on nondeterministic tree automata. This concerns namely techniques for size reduction and language inclusion testing, which are two…

Formal Languages and Automata Theory · Computer Science 2017-06-13 Lukáš Holík

We study Hecke algebras of groups acting on trees with respect to geometrically defined subgroups. In particular, we consider Hecke algebras of groups of automorphisms of locally finite trees with respect to vertex and edge stabilizers and…

Operator Algebras · Mathematics 2008-05-22 Udo Baumgartner , Marcelo Laca , Jacqui Ramagge , George Willis

We develop a Helmholtz-like theorem for differential forms in Euclidean space $E_{n}$ using a uniqueness theorem similar to the one for vector fields. We then apply it to Riemannian manifolds, $R_{n}$, which, by virtue of the…

General Mathematics · Mathematics 2014-12-02 Jose G. Vargas

We classify the localizing tensor ideals of the integral stable module category for any finite group $G$. This results in a generic classification of $\mathbb{Z}[G]$-lattices of finite and infinite rank and globalizes the modular case…

Representation Theory · Mathematics 2021-09-17 Tobias Barthel

Generalization problems in languages with binders involve computing the most common structure between expressions while respecting bound variable renaming and freshness constraints. These problems often lack a least general solution.…

Logic in Computer Science · Computer Science 2025-02-27 Daniele Nantes-Sobrinho , Manfred Schmidt-Schauss , Alexander Baumgartner , Temur Kutsia