English
Related papers

Related papers: F-finite embeddabilities of sets and ultrafilters

200 papers

A set A of natural numbers is finitely embeddable in another such set B if every finite subset of A has a rightward translate that is a subset of B. This notion of finite embeddability arose in combinatorial number theory, but in this paper…

Logic · Mathematics 2015-12-11 Andreas Blass , Mauro Di Nasso

In [1] the authors showed some basic properties of a pre-order that arose in combinatorial number theory, namely the finite embeddability between sets of natural numbers, and they presented its generalization to ultrafilters, which is…

Logic · Mathematics 2014-06-13 Lorenzo Luperi Baglini

We continue the exploration of various aspects of divisibility of ultrafilters, adding one more relation to the picture: multiplicative finite embeddability. We show that it lies between divisibility relations $\mid_M$ and…

Logic · Mathematics 2021-03-17 Boris Šobot

There is a long history of studying Ramsey theory using the algebraic structure of the Stone-\v{C}ech compactification of discrete semigroup. It has been shown that various Ramsey theoretic structures are contained in different algebraic…

General Topology · Mathematics 2021-08-12 Dibyendu De , Pintu Debnath , Sayan Goswami

Let $S$ be an infinite discrete semigroup. The operation on $S$ extends uniquely to the Stone-\v{C}ech compactification $\beta S$ making $\beta S$ a compact right topological semigroup with $S$ contained in its topological center. As such,…

Logic · Mathematics 2018-05-21 Will Brian , Neil Hindman

Let $S$ and $\mathcal{C}$ be affine semigroups in $\mathbb{N}^d$ such that $S\subseteq \mathcal{C}$. We provide a characterization for the set $\mathcal{C}\setminus S$ to be finite, together with a procedure and computational tools to check…

Commutative Algebra · Mathematics 2024-02-09 Carmelo Cisto

We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…

Combinatorics · Mathematics 2010-09-06 Jan Hubicka

Let $(S,\cdot)$ be a semigroup and $\mathfrak{m}$ be a $\sigma$-algebra on $S$. We say $(S,\cdot,\mathfrak{m})$ is a measurable semigroup if $\pi:S\times S\longrightarrow S$ by $\pi(x,y)=x\cdot y$ is a measurable function. In this paper ,…

Functional Analysis · Mathematics 2019-05-07 A. Pashapournia , M. Akbari Tootkaboni , D. Ebrahimbagha

Using the notions of Topological dynamics, H. Furstenberg defined central sets and proved the Central Sets Theorem. Later V. Bergelson and N. Hindman characterized central sets in terms of algebra of the Stone-\v{C}ech compactification of…

Combinatorics · Mathematics 2024-10-30 Dibyendu De , Sujan Pal , Jyotirmoy Poddar

Let $\mathcal{C}\subseteq \mathbb{N}^p$ be an integer cone. A $\mathcal{C}$-semigroup $S\subseteq \mathcal{C}$ is an affine semigroup such that the set $\mathcal{C}\setminus S$ is finite. Such $\mathcal{C}$-semigroups are central to our…

Commutative Algebra · Mathematics 2024-09-11 J. C. Rosales , R. Tapia-Ramos , A. Vigneron-Tenorio

Let $S\subseteq \mathbb N^p$ be a semigroup, any $P\subseteq S$ is an ideal of $S$ if $P+S\subseteq P$, and an $I(S)$-semigroup is the affine semigroup $P\cup \{0\}$, with $P$ an ideal of $S$. We characterise the $I(S)$-semigroups and the…

Commutative Algebra · Mathematics 2024-05-24 J. I. García-García , R. Tapia-Ramos , A. Vigneron-Tenorio

Algorithms for listing the subgraphs satisfying a given property (e.g.,being a clique, a cut, a cycle, etc.) fall within the general framework of set systems. A set system (U, F) uses a ground set U (e.g., the network nodes) and an…

Discrete Mathematics · Computer Science 2018-03-13 Alessio Conte , Roberto Grossi , Andrea Marino , Luca Versari

In this paper, we prove a series of results on group embeddings in groups with a small number of generators. We show that each finitely generated group $G$ lying in a variety ${\mathcal M}$ can be embedded in a $4$-generated group $H \in…

Group Theory · Mathematics 2020-09-22 Vitaly Roman'kov

Let G be a reductive algebraic group and let H be a reductive subgroup of G. We describe all pairs (G,H) such that for any affine G-variety X with a dense G-orbit isomorphic to G/H the number of G-orbits in X is finite. The maximal number…

Algebraic Geometry · Mathematics 2009-10-03 I. V. Arzhantsev , D. A. Timashev

Let $U$ be an absolute ultrafilter on the set of non-negative integers $\mathbb{N}$. For any sequence $x=(x_n)_{n\geq 0}$ of real numbers, let $U(x)$ denote the topological filter consisting of the open sets $W$ of $\mathbb{R}$ with $\{n…

General Topology · Mathematics 2024-05-17 Mohamed Benslimane

The theory of finitely supported algebraic structures represents a reformulation of Zermelo-Fraenkel set theory in which every construction is finitely supported according to the action of a group of permutations of some basic elements…

Logic · Mathematics 2019-09-05 Andrei Alexandru , Gabriel Ciobanu

We introduce a notion of integration defined from filters over families of finite sets. This procedure corresponds to determining the average value of functions whose range lies in any algebraic structure in which finite averages make…

Logic · Mathematics 2021-08-27 Emanuele Bottazzi , Monroe Eskew

If $S$ is a discrete semigroup, then $\beta S$ has a natural, left-topological semigroup structure extending $S$. Under some very mild conditions, $U(S)$, the set of uniform ultrafilters on $S$, is a two-sided ideal of $\beta S$, and…

Rings and Algebras · Mathematics 2015-05-11 Will Brian

Let $p$ be a prime, $S$ be a $p$-group and $\mathcal{F}$ be a saturated fusion system over $S$. Then $\mathcal{F}$ is said to be supersolvable, if there exists a series of $S$, namely $1 = S_0 \leq S_1 \leq \cdots \leq S_n = S$, such that…

Group Theory · Mathematics 2024-02-11 Shengmin Zhang , Zhencai Shen

Ultrafilters are very useful and versatile objects with applications throughout mathematics: in topology, analysis, combinarotics, model theory, and even theory of social choice. Proofs based on ultrafilters tend to be shorter and more…

Dynamical Systems · Mathematics 2013-10-17 Jakub Konieczny
‹ Prev 1 2 3 10 Next ›