English
Related papers

Related papers: Counting siblings in universal theories

200 papers

We establish a dichotomy theorem characterizing the circumstances under which a treeable Borel equivalence relation E is essentially countable. Under additional topological assumptions on the treeing, we in fact show that E is essentially…

Logic · Mathematics 2014-08-19 Dominique Lecomte , John D. Clemens , Benjamin D. Miller

The profile of a relational structure R is the function phi_R which counts for every integer n the number, possibly infinite, phi_R(n) of substructures of R induced on the n-element subsets, isomorphic substructures being identified.…

Combinatorics · Mathematics 2007-05-23 Maurice Pouzet , Nicolas M. Thiéry

We show that a suitable ring with a ``nice'' topology, in which convergent limits of units are units, is an \aleph_0-exchange ring. We generalize the argument to show that a semi-regular ring, R, with a ``nice'' topology, is a full exchange…

Rings and Algebras · Mathematics 2007-05-23 Pace P. Nielsen

Over each nontrivial finite group $G$, there exists a finite system of equations having no solutions in larger finite groups but having a solution in a periodic group containing $G$. We prove several similar facts about amenable, orderable,…

Group Theory · Mathematics 2025-03-04 Alexander Buturlakin , Anton Klyachko , Denis Osin

Representable implication algebras are known to be axiomatised by a finite number of equations (making the representation and finite representation problems decidable here). We show that this also holds in the context of unary (and binary)…

Logic · Mathematics 2023-01-09 Andrew Lewis-Smith Jaš Šemrl

A set of integers is $S$-recognizable in an abstract numeration system $S$ if the language made up of the representations of its elements is accepted by a finite automaton. For abstract numeration systems built over bounded languages with…

Discrete Mathematics · Computer Science 2008-09-16 Emilie Charlier , Michel Rigo , Wolfgang Steiner

It is shown the construction of a module structure [2] with universe over a set of a particular kind of mathematical proofs, the base ring of this module will be built on a maximal consistent extension of a set of propositions, this…

Logic · Mathematics 2013-07-25 Kevin Davila Castellar , Ismael Gutierrez Garcia

We relate the existence problem of universal objects to the properties of corresponding enriched categories (lifts or expansions). In particular, extending earlier results, we prove that for every (possibly infinite) regular set F of finite…

Combinatorics · Mathematics 2013-03-05 Jan Hubička , Jaroslav Nešetřil

The finite models of a universal sentence $\Phi$ in a finite relational signature are the age of a structure if and only if $\Phi$ has the joint embedding property. We prove that the computational problem whether a given universal sentence…

Logic in Computer Science · Computer Science 2024-02-14 Manuel Bodirsky , Jakub Rydval , André Schrottenloher

We give a simpler proof of a result of Hodkinson in the context of a blow and blur up construction argueing that the idea at heart is similar to that adopted by Andr\'eka et all \cite{sayed}. The idea is to blow up a finite structure,…

Logic · Mathematics 2013-05-21 Tarek Sayed Ahmed

We construct new examples of non-nil algebras with any number of generators, which are direct sums of two locally nilpotent subalgebras. As all previously known examples, our examples are contracted semigroup algebras and the underlying…

Rings and Algebras · Mathematics 2007-05-23 Vesselin Drensky , Lakhdar Hammoudi

A family of algebraic surfaces with many nondegenerate real singularities is introduced with the help of a construction, which has been used in previous works for the generation of substitution tilings.

Mathematical Physics · Physics 2011-11-08 J. G. Escudero

We first show that increasing trees are in bijection with set compositions, extending simultaneously a recent result on trees due to Tonks and a classical result on increasing binary trees. We then consider algebraic structures on the…

Combinatorics · Mathematics 2007-05-23 Frederic Patras , Manfred Schocker

We introduce order conserving embeddings as a more general form of order preserving embeddings between finite dimensional nest algebras. The structure of these embeddings is determined, in terms of order indecomposable decompositions, and…

Operator Algebras · Mathematics 2007-05-23 Alan Hopenwasser , Stephen C. Power

We consider the counting problem of the number of \textit{leaf-labeled increasing trees}, where internal nodes may have an arbitrary number of descendants. The set of all such trees is a discrete representation of the genealogies obtained…

Populations and Evolution · Quantitative Biology 2022-11-08 Johannes Wirtz

It was shown in \cite{sc12} that for a certain class of structures $\I$, $\I$-indexed indiscernible sets have the modeling property just in case the age of $\I$ is a Ramsey class. We expand this known class of structures from ordered…

Logic · Mathematics 2016-02-10 Lynn Scow

This paper presents a substructural logic of sequents with very restricted exchange and weakening rules. It is sound with respect to sequences of measurements of a quantic system. A sound and complete semantics is provided. The semantic…

Quantum Physics · Physics 2023-07-19 Daniel Lehmann

Let $\Lambda$ be a Legendrian in the jet space of some manifold $X$. To a generating family presentation of $\Lambda$, we associate a constructible sheaf on $X \times \mathbb{R}$ whose singular support at infinity is $\Lambda$, and such…

Symplectic Geometry · Mathematics 2018-09-11 Vivek Shende

A classical theorem of Forster asserts that a finite module $M$ of rank $\leq n$ over a Noetherian ring of Krull dimension $d$ can be generated by $n + d$ elements. We prove a generalization of this result, with "module" replaced by…

Rings and Algebras · Mathematics 2016-12-13 Uriya A. First , Zinovy Reichstein

Binary multirelations generalise binary relations by associating elements of a set to its subsets. We study the structure and algebra of multirelations under the operations of union, intersection, sequential and parallel composition, as…

Logic in Computer Science · Computer Science 2015-06-16 Hitoshi Furusawa , Georg Struth
‹ Prev 1 4 5 6 7 8 10 Next ›