English
Related papers

Related papers: Packing index of subsets in Polish groups

200 papers

F. Wehrung has asked: Given a family $\mathcal{C}$ of subsets of a set $\Omega$, under what conditions will there exist a total ordering on $\Omega$ under which every member of $\mathcal{C}$ is convex? <p> Note that if $A$ and $B$ are…

Combinatorics · Mathematics 2020-11-17 George M. Bergman

Given a family $\F$ of posets closed under disjoint unions and the operation of taking convex subposets, we construct a category $\C_{\F}$ called the \emph{incidence category of $\F$}. This category is "nearly abelian" in the sense that all…

Quantum Algebra · Mathematics 2009-10-29 Matt Szczesny

Our main result is that, given a collection $\mathcal{R}$ of meager relations on a Polish space $X$ such that $|\mathcal{R}|\leq\omega$, there exists a dense Baire subspace $F$ of $X$ (equivalently, a nowhere meager subset $F$ of $X$) such…

General Topology · Mathematics 2017-06-21 Andrea Medini , Dušan Repovš , Lyubomyr Zdomskyy

A topological space is almost locally compact if it contains a dense locally compact subspace. We generalize a result from \cite{Ma}, showing that isomorphism on Borel classes of almost locally compact Polish metric structures is always…

Logic · Mathematics 2025-08-12 Maciej Malicki

Let $G$ be a group and $A\subseteq G$ a non-empty subset. A right $s$-factor associated with $A$ is a maximal subset $U\subseteq G$ such that the product $AU$ is direct. The lower and upper $s$-indices $|G:A|^-$ and $|G:A|^+$ are defined as…

Group Theory · Mathematics 2026-02-27 Mikhail Kabenyuk

Let $G$ be a finite abelian group. The critical number ${\rm cr}(G)$ of $G$ is the least positive integer $\ell$ such that every subset $A\subseteq G\setminus\{0\}$ of cardinality at least $\ell$ spans $G$, i.e., every element of $G$ can be…

Combinatorics · Mathematics 2011-03-31 Dan Guo , Yongke Qu , Guoqing Wang , Qinghong Wang

We investigate the local topological structure of non-metrizable topological groups through the lens of Tukey order and cofinal types. Motivated by recent advances in topological groups admitting an $\omega^\omega$-base, we introduce the…

General Topology · Mathematics 2026-05-26 Xuan Gong , Dekui Peng

We prove that no quantifier-free formula in the language of group theory can define the $\aleph_1$-half graph in a Polish group, thus generalising some results from [6]. We then pose some questions on the space of groups of automorphisms of…

Logic · Mathematics 2019-11-12 Gianluca Paolini , Saharon Shelah

Let G be an infinite discrete group and bG its Cech-Stone compactification. Using the well known fact that a free ultrafilter on an infinite set is nonmeasurable, we show that for each element p of the remainder bG G, left multiplication…

Dynamical Systems · Mathematics 2021-03-03 Eli Glasner

Let $G$ and $H$ be graphs. We say that $P$ is an $H$-packing of $G$ if $P$ is a set of edge-disjoint copies of $H$ in $G$. An $H$-packing $P$ is maximal if there is no other $H$-packing of $G$ that properly contains $P$. Packings of maximum…

Combinatorics · Mathematics 2018-07-16 Maria Axenovich , Anika Kaufmann , Raphael Yuster

We prove that, if a topological group $G$ has an open subgroup of infinite index, then every net of tight Borel probability measures on $G$ UEB-converging to invariance dissipates in $G$ in the sense of Gromov. In particular, this solves a…

Metric Geometry · Mathematics 2020-01-22 Friedrich Martin Schneider

Let $G \otimes _f H$ denote the Sierpi\'nski product of graphs $G$ and $H$ with respect to the function $f$. The Sierpi\'nski general position number ${\rm gp}{_{\rm S}}(G,H)$ is introduced as the cardinality of a largest general position…

Combinatorics · Mathematics 2025-12-10 Sandi Klavžar , Jing Tian

Let $G$ consist of all functions $g \colon \omega \to [0,\infty)$ with $g(n) \to \infty$ and $\frac{n}{g(n)} \nrightarrow 0$. Then for each $g\in G$ the family $\mathcal{Z}_g=\{A\subseteq\omega:\ \lim_{n\to\infty}\frac{\text{card}(A\cap…

Functional Analysis · Mathematics 2019-04-12 Adam Kwela , Michał Popławski , Jarosław Swaczyna , Jacek Tryba

Let $X$ be a Polish space and $K$ a separable compact subset of the first Baire class on $X$. For every sequence $\bs$ dense in $\kk$, the descriptive set-theoretic properties of the set \[ \lbf=\{L\in[\nn]: (f_n)_{n\in L} \text{is…

Logic · Mathematics 2008-05-15 Pandelis Dodos

The $d$-distance $p$-packing domination number $\gamma_d^p(G)$ of a graph $G$ is the cardinality of a smallest set of vertices of $G$ which is both a $d$-distance dominating set and a $p$-packing. If no such set exists, then we set…

Combinatorics · Mathematics 2025-10-06 Csilla Bujtás , Vesna Iršič Chenoweth , Sandi Klavžar , Gang Zhang

A countable, bounded degree graph is almost finite if it has a tiling with isomorphic copies of finitely many F\o lner sets, and we call it strongly almost finite, if the tiling can be randomized so that the probability that a vertex is on…

Group Theory · Mathematics 2025-09-22 Gábor Elek , Ádám Timár

We say that a group $G$ is almost Engel if for every $g\in G$ there is a finite set ${\mathscr E}(g)$ such that for every $x\in G$ all sufficiently long commutators $[...[[x,g],g],\dots ,g]$ belong to ${\mathscr E}(g)$, that is, for every…

Group Theory · Mathematics 2017-05-16 E. I. Khukhro , P. Shumyatsky

For a Polish group $G$, let $E(G)$ be the right coset equivalence relation $G^\omega/c(G)$, where $c(G)$ is the group of all convergent sequences in $G$. We prove a Rigid theorem on locally compact TSI Polish groups admitting open identity…

Logic · Mathematics 2024-10-30 Yang Zheng

Let $G$ be a connected semi-simple algebraic group of adjoint type over an algebraically closed field, and let $\overline{G}$ be the wonderful compactification of $G$. For a fixed pair $(B, B^-)$ of opposite Borel subgroups of $G$, we look…

Representation Theory · Mathematics 2009-07-08 Xuhua He , Jiang-Hua Lu

Given a graph~$G$, the domination number, denoted by~$\gamma(G)$, is the minimum cardinality of a dominating set in~$G$. Dual to the notion of domination number is the packing number of a graph. A packing of~$G$ is a set of vertices whose…

Combinatorics · Mathematics 2024-02-09 Renzo Gómez , Juan Gutiérrez
‹ Prev 1 4 5 6 7 8 10 Next ›