中文
相关论文

相关论文: The cofinality spectrum of the infinite symmetric …

200 篇论文

Let $\Gamma(G)$ be the Gruenberg-Kegel graph of a finite group $G$. We prove that if $G$ is solvable and $\sigma$ is a cut-set for $\Gamma(G)$, then $G$ has a $\sigma$-series of length $5$ whose factors are controlled. As a consequence, we…

群论 · 数学 2025-04-29 Lorenzo Bonazzi

The balanced chromatic number of a signed graph G is the minimum number of balanced sets that cover all vertices of G. Studying structural conditions which imply bounds on the balanced chromatic number of signed graphs is among the most…

We show that the consistency of $\mathrm{ZF} + \mathrm{AD}_{\mathbb{R}} + ``\Theta$ is measurable$"$ implies the consistency of $\mathrm{ZF} +``\Theta$ is the least strongly regular cardinal and the least measurable cardinal$"$ + $``$all…

逻辑 · 数学 2026-03-11 Rahman Mohammadpour , Otto Rajala , Sebastiano Thei

Any finite simple graph $G = (V,E)$ can be represented by a collection $\mathscr{C}$ of subsets of $V$ such that $uv\in E$ if and only if $u$ and $v$ appear together in an odd number of sets in $\mathscr{C}$. Let $c_2(G)$ denote the minimum…

组合数学 · 数学 2022-12-08 Calum Buchanan , Christopher Purcell , Puck Rombach

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…

组合数学 · 数学 2011-03-31 Dan Guo , Yongke Qu , Guoqing Wang , Qinghong Wang

Let $\chi$ be an irreducible character of a group $G.$ We denote the sum of the codegrees of the irreducible characters of $G$ by $S_c(G)=\sum_{\chi\in {\rm Irr}(G)}{\rm cod}(\chi).$ We consider the question if $S_c(G)\leq S_c(C_n)$ is true…

群论 · 数学 2024-02-21 Mark L. Lewis , Quanfu Yan

Suppose that $G$ is a graph of cardinality $\mu^+$ with chromatic number $\chi(G)\geq \mu^+$. One possible reason that this could happen is if $G$ contains a clique of size $\mu^+$. We prove that this is indeed the case when the edge…

逻辑 · 数学 2025-11-12 Yatir Halevi , Itay Kaplan , Saharon Shelah

A set $S$ of vertices in a graph $G(V,E)$ is called a dominating set if every vertex $v\in V$ is either an element of $S$ or is adjacent to an element of $S$. A set $S$ of vertices in a graph $G(V,E)$ is called a total dominating set if…

组合数学 · 数学 2008-10-28 Maryam Atapour , Nasrin Soltankhah

A usual dichotomy is that in many cases, reasonably definable sets, satisfy the CH, i.e. if they are uncountable they have cardinality continuum. A strong dichotomy is when: if the cardinality is infinite it is continuum as in [Sh:273]. We…

逻辑 · 数学 2016-09-07 Saharon Shelah

A supercharacter theory for a finite group $G$ is a set of superclasses each of which is a union of conjugacy classes together with a set of sums of irreducible characters called supercharacters that together satisfy certain compatibility…

群论 · 数学 2016-05-31 Ali Reza Ashrafi , Fatemeh Koorepazan-Moftakhar

The fixing number of a graph $G$ is the smallest cardinality of a set of vertices $S$ such that only the trivial automorphism of $G$ fixes every vertex in $S$. The fixing set of a group $\Gamma$ is the set of all fixing numbers of finite…

组合数学 · 数学 2024-10-15 Courtney R. Gibbons , Joshua D. Laison

The normal covering number $\gamma(G)$ of a finite, non-cyclic group $G$ is the minimum number of proper subgroups such that each element of $G$ lies in some conjugate of one of these subgroups. We find lower bounds linear in $n$ for…

群论 · 数学 2020-12-09 Daniela Bubboloni , Cheryl E. Praeger , Pablo Spiga

We show that the commutator subgroup G' of a classical knot group G need not have subgroups of every finite index, but it will if G' has a surjective homomorphism to the integers and we give an exact criterion for that to happen. We also…

几何拓扑 · 数学 2007-05-23 J. O. Button

We investigate the provability of classical combinatorial theorems in ZF. Using combinatorial arguments, we establish the following results for each infinite cardinal ${\kappa}\in On$, (1) ${\kappa}^+\to ({\kappa},{\omega}+1)$, (2) any…

逻辑 · 数学 2023-06-13 Tamás Csernák , Lajos Soukup

A graph $G$ is said to be $\preceq$-ubiquitous, where $\preceq$ is the minor relation between graphs, if whenever $\Gamma$ is a graph with $nG \preceq \Gamma$ for all $n \in \mathbb{N}$, then one also has $\aleph_0 G \preceq \Gamma$, where…

Let \( G \) be a finite non-cyclic group. Define \( \mathrm{Cyc}(G) \) as the set of all elements \( a \in G \) such that for any $b\in G$, the subgroup \( \langle a, b \rangle \) is cyclic. The \emph{non-cyclic graph} $\Gamma(G)$ of \( G…

组合数学 · 数学 2025-04-22 Parveen Parveen , Bikash Bhattacharjya

Let G be a finite group and S a subset of G\{0}. We call S an additive basis of G if every element of G can be expressed as a sum over a nonempty subset in some order. Let cr(G) be the smallest integer t such that every subset of G\{0} of…

数论 · 数学 2012-12-05 Qinghong Wang , Yongke Qu

Let $\sigma =\{\sigma_{i} | i\in I\}$ be some partition of the set of all primes $\Bbb{P}$. A set ${\cal H}$ of subgroups of $G$ is said to be a \emph{complete Hall $\sigma $-set} of $G$ if every member $\ne 1$ of ${\cal H}$ is a Hall…

群论 · 数学 2016-08-12 Wenbin Guo , Alexander N. Skiba

Let T be a complete, first-order theory in a finite or countable language having infinite models. Let I(T,kappa) be the number of isomorphism types of models of T of cardinality \kappa. We denote by \mu (respectively \hat\mu) the number of…

逻辑 · 数学 2016-09-07 Bradd Hart , Ehud Hrushovski , Michael C. Laskowski

Let $S$ be the spectrum of a complete discrete valuation ring with fraction field of characteristic 0 and perfect residue field of characteristic $p\geq 3$. Let $G$ be a truncated Barsotti-Tate group of level 1 over $S$. If ``$G$ is not too…

数论 · 数学 2008-08-19 Yichao Tian