English
Related papers

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

200 papers

We discuss different generalizations of Zariski decomposition, relations between them and connections with finite generation of divisorial algebras.

Algebraic Geometry · Mathematics 2010-04-26 Yuri G. Prokhorov

We develop the theory of invariant structure preserving and free functions on a general structured topological space. We show that an invariant structure preserving function is pointwise approximiable by the appropriate analog of…

Functional Analysis · Mathematics 2021-04-07 J. E. Pascoe

Bivariate generating functions for various subsets of the class of permutations containing no descending sequence of length three or more are determined. The notion of absolute indecomposability of a permutation is introduced, and used in…

Combinatorics · Mathematics 2015-08-07 Michael H. Albert

Orbit-finite sets are a generalisation of finite sets, and as such support many operations allowed for finite sets, such as pairing, quotienting, or taking subsets. However, they do not support function spaces, i.e. if X and Y are…

Logic in Computer Science · Computer Science 2024-04-09 Mikołaj Bojańczyk , Lê Thành Dũng Nguyên , Rafał Stefański

We classify finitely generated, residually finite automorphism-induced HNN-extensions in terms of the residual separability of a single associated subgroup. This classification provides a method to construct automorphism-induced…

Group Theory · Mathematics 2018-10-25 Alan D. Logan

This paper develops the algebraic foundation required to build a Zariski-type geometry for \emph{commutative ternary $\Gamma$-semirings}, where multiplication is an inherently triadic, multi-parametric interaction…

Rings and Algebras · Mathematics 2025-12-25 Chandrasekhar Gokavarapu , D. Madhusudhana Rao

The matrix units of a digraph algebra, A, induce a relation, known as the diagonal order, on the projections in a masa in the algebra. Normalizing partial isometries in A act on these projections by conjugation; they are said to be order…

funct-an · Mathematics 2016-08-31 Alan Hopenwasser , Allan Donsig

Polynomial completeness results aim at characterizing those functions that are induced by polynomials. Each polynomial function is congruence preserving, but the opposite need not be true. A finite algebraic structure $\mathbf{A}$ is called…

Rings and Algebras · Mathematics 2024-04-23 Bernardo Rossi

We introduce a generating function associated to the homogeneous generators of a graded algebra that measures how far is this algebra from being finitely generated. For the case of some algebras of Frobenius endomorphisms we describe this…

Commutative Algebra · Mathematics 2019-10-01 Josep Àlvarez Montaner

We consider the problem of characterizing entrywise functions that preserve the cone of positive definite matrices when applied to every off-diagonal element. Our results extend theorems of Schoenberg [Duke Math. J. 9], Rudin [Duke Math. J.…

Classical Analysis and ODEs · Mathematics 2013-05-17 Dominique Guillot , Bala Rajaratnam

The Tarskian classical relevant logic TR arises from Tarski's work on the foundations of the calculus of relations and on first-order logic restricted to finitely many variables, presented by Tarski and Givant their book, A Formalization of…

Logic · Mathematics 2020-09-29 Roger D. Maddux

It is well known that if a function from set A to set B has a right inverse then the function is a surjection and the right inverse is an injection. For finite sets, the number of functions, injections, and surjections can also be counted.…

Discrete Mathematics · Computer Science 2015-01-09 Roy S. Freedman

In this article, we give a representation of bounded complex linear operators which preserve idempotent elements on the Fourier algebra of a locally compact group. When such an operator is moreover positive or contractive, we show that the…

Functional Analysis · Mathematics 2023-02-03 Ying-Fen Lin , Shiho Oi

We represent finite join-semilattices and join-preserving morphisms as a category whose objects and morphisms are binary relations. It is a quotient category of $\mathsf{Rel}_f$'s arrow category, where self-duality arises by taking the…

Category Theory · Mathematics 2020-07-21 Robert Samuel Ralph Myers

The Triguarded Fragment (TGF) is among the most expressive decidable fragments of first-order logic, subsuming both its two-variable and guarded fragments without equality. We show that the TGF has the finite model property (providing a…

Logic in Computer Science · Computer Science 2021-01-26 Emanuel Kieroński , Sebastian Rudolph

On a smooth algebraic variety over $\mathbb{C}$, we build the tempered subanalytic and Stein tempered subanalytic sites. We construct the sheaf of holomorphic functions tempered at infinity over these sites and study their relations with…

Algebraic Geometry · Mathematics 2017-03-03 Francois Petit

Groups preserving a distributive product are encountered often in algebra. Examples include automorphism groups of associative and nonassociative rings, classical groups, and automorphism groups of p-groups. While the great variety of such…

Group Theory · Mathematics 2015-01-21 Peter A. Brooksbank , James B. Wilson

It is shown that a finitely generated branch group has Serre's property (FA) if and only if it does not surject onto the infinite cyclic group or the infinite dihedral group. An example of a finitely generated self-similar branch group…

Group Theory · Mathematics 2007-05-23 Thomas Delzant , Rostislav Grigorchuk

Demonic composition, demonic refinement and demonic union are alternatives to the usual "angelic" composition, angelic refinement (inclusion) and angelic (usual) union defined on binary relations. We first motivate both the angelic and…

Logic in Computer Science · Computer Science 2021-01-14 Robin Hirsch , Szabolcs Mikulás , Tim Stokes

Tarski gave a general semantics for deductive reasoning: a formula a may be deduced from a set A of formulas iff a holds in all models in which each of the elements of A holds. A more liberal semantics has been considered: a formula a may…

Artificial Intelligence · Computer Science 2007-05-23 Daniel Lehmann
‹ Prev 1 4 5 6 7 8 10 Next ›