English
Related papers

Related papers: Preservation theorems for Tarski's relation algebr…

200 papers

Looking at some monoids and (semi)rings (natural numbers, integers and p-adic integers), and more generally, residually finite algebras (in a strong sense), we prove the equivalence of two ways for a function on such an algebra to behave…

Logic in Computer Science · Computer Science 2020-04-14 Patrick Cegielski , Serge Grigorieff , Irene Guessarian

We provide polynomial completeness results for finite algebras in congruence permutable varieties. In 2001, Idziak and S{\l}omczy{\'n}ska introduced the completeness concept of being \emph{polynomially rich}: a finite algebra is…

Rings and Algebras · Mathematics 2026-04-01 Erhard Aichinger , Mario Kapl , Bernardo Rossi

The polynomial method has been used recently to obtain many striking results in combinatorial geometry. In this paper, we use affine Hilbert functions to obtain an estimation theorem in finite field geometry. The most natural way to state…

Combinatorics · Mathematics 2014-03-04 Zipei Nie , Anthony Y. Wang

We study generating functions in the context of Rota-Baxter algebras. We show that exponential generating functions can be naturally viewed in a very special case of complete free commutative Rota-Baxter algebras. This allows us to use free…

Combinatorics · Mathematics 2015-10-15 Nancy Shanshan Gu , Li Guo

The class of finitely presented algebras over a field $K$ with a set of generators $a_{1},..., a_{n}$ and defined by homogeneous relations of the form $a_{1}a_{2}... a_{n} =a_{\sigma (a)} a_{\sigma (2)} ... a_{\sigma (n)}$, where $\sigma$…

Rings and Algebras · Mathematics 2008-10-03 F. Cedo , E. Jespers , J. Okninksi

We reprove the countable splitting lemma by adapting Nawrotzki's algorithm which produces a sequence that converges to a solution. Our algorithm combines Nawrotzki's approach with taking finite cuts. It is constructive in the sense that…

Logic in Computer Science · Computer Science 2021-06-15 Ana Sokolova , Harald Woracek

We define the $\frac{\mathbb{Z}}{2}$-graded meromorphic open-string vertex algebra that is an appropriate noncommutative generalization of the vertex operator superalgebra. We also illustrate an example that can be viewed as a…

Quantum Algebra · Mathematics 2023-09-12 Francesco Fiordalisi , Fei Qi

In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…

Computational Complexity · Computer Science 2016-08-15 Peter Franek , Stefan Ratschan , Piotr Zgliczynski

Brzezi\'nski's trusses are ``ring-like'' algebraic structures in which the addition is replaced with an abelian heap operation and the binary product satisfies a natural distributivity rule of the ternary product. The question of how to…

Mathematical Physics · Physics 2026-05-13 Andrew James Bruce

We show that given a finitely generated LERF group $G$ with positive rank gradient, and finitely generated subgroups $A,B \leq G$ of infinite index, one can find a finite index subgroup $B_0$ of $B$ such that $[G : \langle A \cup B_0…

Group Theory · Mathematics 2016-02-02 Mark Shusterman

A generating function of the number of homomorphisms from the fundamental group of a compact oriented or non-orientable surface without boundary into a finite group is obtained in terms of an integral over a real group algebra. We calculate…

Quantum Algebra · Mathematics 2007-05-23 Motohico Mulase , Josephine T. Yu

We systematically study conservation theorems on theories of semi-classical arithmetic, which lie in-between classical arithmetic $\mathsf{PA}$ and intuitionistic arithmetic $\mathsf{HA}$. Using a generalized negative translation, we first…

Logic · Mathematics 2022-03-15 Makoto Fujiwara , Taishi Kurahashi

An $h$-ary relation $\r$ on a finite set $A$ is said to be \emph{hereditarily rigid} if the unary partial functions on $A$ that preserve $\r$ are the subfunctions of the identity map or of constant maps. A family of relations ${\mathcal F}$…

Combinatorics · Mathematics 2015-05-12 Miguel Couceiro , Lucien Haddad , Maurice Pouzet , Karsten Schölzel

We study the problem to decide, given sets T1,T2 of tuple-generating dependencies (TGDs), also called existential rules, whether T2 is a conservative extension of T1. We consider two natural notions of conservative extension, one pertaining…

Databases · Computer Science 2022-04-25 Jean Christoph Jung , Carsten Lutz , Jerzy Marcinkowski

We present a property satisfied by a large variety of complex continued fraction algorithms (the "finite building property") and use it to explore the structure of bijectivity domains for natural extensions of Gauss maps. Specifically, we…

Dynamical Systems · Mathematics 2019-11-06 Adam Abrams

Martin's Conjecture is a proposed classification of the definable functions on the Turing degrees. It is usually divided into two parts, the first of which classifies functions which are not above the identity and the second of which…

Logic · Mathematics 2024-04-08 Patrick Lutz , Benjamin Siskind

We describe the structure of all codimension-two lattice configurations $A$ which admit a stable rational $A$-hypergeometric function, that is a rational function $F$ all whose partial derivatives are non zero, and which is a solution of…

Algebraic Geometry · Mathematics 2009-07-18 Eduardo Cattani , Alicia Dickenstein , Fernando Rodriguez Villegas

We give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order -- the extensional order -- and a bistable coherence, which captures…

Programming Languages · Computer Science 2017-01-11 James Laird

A class of structures is said to have the homomorphism-preservation property just in case every first-order formula that is preserved by homomorphisms on this class is equivalent to an existential-positive formula. It is known by a result…

Logic in Computer Science · Computer Science 2009-03-08 Anuj Dawar

We develop a novel formal theory of finite structures, based on a view of finite structures as a fundamental artifact of computing and programming, forming a common platform for computing both within particular finite structures, and in the…

Logic in Computer Science · Computer Science 2018-08-16 Daniel Leivant
‹ Prev 1 8 9 10 Next ›