中文
相关论文

相关论文: Centerpole sets for colorings of Abelian groups

200 篇论文

Given a finite group $G$ acting freely on a compact metric space $M$, and $\epsilon>0$, we define the $G$-Borsuk graph on $M$ by drawing edges $x\sim y$ whenever there is a non-identity $g\in G$ such that $d(x,gy)\leq\epsilon$. We show that…

组合数学 · 数学 2024-10-15 Francisco Martinez-Figueroa

Let $G$ be a graph. We introduce the acyclic b-chromatic number of $G$ as an analogue to the b-chromatic number of $G$. An acyclic coloring of a graph $G$ is a map $c:V(G)\rightarrow \{1,\dots,k\}$ such that $c(u)\neq c(v)$ for any $uv\in…

组合数学 · 数学 2022-12-27 Marcin Anholcer , Sylwia Cichacz , Iztok Peterin

Suppose that $k\geq 2$ and $A$ is a non-empty subset of a finite abelian group $G$ with $|G|>1$. Then the cardinality of the restricted sumset $$ k^\wedge A:=\{a_1+\cdots+a_k:\,a_1,\ldots,a_k\in A,\ a_i\neq a_j\text{ for }i\neq j\} $$ is at…

组合数学 · 数学 2024-03-07 Shanshan Du , Hao Pan

We prove that for each partition of the Lobachevsky plane into finitely many Borel pieces one of the cells of the partition contains an unbounded centrally symmetric subset.

组合数学 · 数学 2010-02-08 T. Banakh , A. Dudko , D. Repovš

Let $c:E(G)\to [k]$ be an edge-coloring of a graph $G$, not necessarily proper. For each vertex $v$, let $\bar{c}(v)=(a_1,\ldots,a_k)$, where $a_i$ is the number of edges incident to $v$ with color $i$. Reorder $\bar{c}(v)$ for every $v$ in…

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…

动力系统 · 数学 2021-03-03 Eli Glasner

A k-fold x-coloring of a graph is an assignment of (at least) k distinct colors from the set {1, 2, ..., x} to each vertex such that any two adjacent vertices are assigned disjoint sets of colors. The smallest number x such that G admits a…

离散数学 · 计算机科学 2016-11-11 Manoel Campêlo , Ricardo C. Corrêa , Phablo F. S. Moura , Marcio C. Santos

Let $G$ be a simple graph on $d$ vertices. We define a monomial ideal $K$ in the Stanley-Reisner ring $A$ of the order complex of the Boolean algebra on $d$ atoms. The monomials in $K$ are in one-to-one correspondence with the proper…

组合数学 · 数学 2007-05-23 Einar Steingrimsson

We equip the product of countably many copies of a compact Abelian group X with the uniform topology, and study some properties of the topological group G thus obtained. In particular, we determine the cardinality of the dual group of G,…

一般拓扑 · 数学 2013-06-03 D. Dikranjan , E. Martín-Peinador , V. Tarieladze

Let N be the set of non-negative integer numbers, T the circle group and c the cardinality of the continuum. Given an abelian group G of size at most 2^c and a countable family F of infinite subsets of G, we construct "Baire many"…

群论 · 数学 2011-02-28 Dikran Dikranjan , Dmitri Shakhmatov

Let G be a discrete group. We give methods to compute for a generalized (co-)homology theory its values on the Borel construction (EG x X)/G of a proper G-CW-complex X satisfying certain finiteness conditions. In particular we give formulas…

K理论与同调 · 数学 2012-01-24 Michael Joachim , Wolfgang Lueck

A subset of a Polish space $X$ is called universally small if it belongs to each ccc $\sigma$-ideal with Borel base on $X$. Under CH in each uncountable Abelian Polish group $G$ we construct a universally small subset $A_0\subset G$ such…

一般拓扑 · 数学 2012-12-19 Taras Banakh , Nadya Lyaskovska

The "clustered chromatic number" of a class of graphs is the minimum integer $k$ such that for some integer $c$ every graph in the class is $k$-colourable with monochromatic components of size at most $c$. We determine the clustered…

组合数学 · 数学 2022-01-24 Sergey Norin , Alex Scott , David R. Wood

If $G$ is the symmetry group of an uncolored pattern then a coloring of the pattern is semiperfect if the associated color group $H$ is a subgroup of $G$ of index 2. We give results on how to identify and enumerate all inequivalent…

组合数学 · 数学 2010-02-03 Rene P. Felix , Manuel Joseph C. Loquias

For every positive integer $k$, a set $S$ of vertices in a graph $G=(V,E)$ is a $k$-tuple dominating set of $G$ if every vertex of $V-S$ is adjacent to least $k$ vertices and every vertex of $S$ is adjacent to least $k-1$ vertices in $S$.…

组合数学 · 数学 2019-06-11 Adel P. Kazemi

Let $G=\big{(}V(G),E(G)\big{)}$ be a graph with minimum degree $k$. A subset $S\subseteq V(G)$ is called a total $k$-dominating set if every vertex in $G$ has at least $k$ neighbors in $S$. Two disjoint sets $A,B\subset V(G)$ form a total…

组合数学 · 数学 2025-12-10 Boštjan Brešar , Sandi Klavžar , Babak Samadi

Let $G=(V,E)$ be a simple graph. For any integer $k\geq 1$, a subset of $V$ is called a $k$-tuple total dominating set of $G$ if every vertex in $V$ has at least $k$ neighbors in the set. The minimum cardinality of a minimal $k$-tuple total…

组合数学 · 数学 2019-08-06 Adel P. Kazemi

For a compact Lie group G we show that if the representing spectrum for Borel cohomology generates its category of modules if G is connected. For a closed subgroup H of G we consider the map C^*(BG)--->C^*(BH) and establish the sense in…

代数拓扑 · 数学 2018-08-23 J. P. C. Greenlees

We explore the Borel complexity of some basic families of subsets of a countable group (large, small, thin, sparse and other) defined by the size of their elements. Applying the obtained results to the Stone-\v{C}ech compactification $\beta…

一般拓扑 · 数学 2017-03-02 Igor Protasov , Taras Banakh , Ksenia Protasova

We embed a countably categorical group G into a locally compact group c(G) with a non-trivial topology and study how topological properties of c(G) are connected with the structure of definable subgroups of G.

逻辑 · 数学 2008-11-04 Al. A. Ivanov
‹ 上一页 1 2 3 10 下一页 ›