中文
相关论文

相关论文: On Graham's rearrangement conjecture over $\mathbb…

200 篇论文

A brief introduction to the theory of ordered sets and lattice theory is given. To illustrate proof techniques in the theory of ordered sets, a generalization of a conjecture of Daykin and Daykin, concerning the structure of posets that can…

组合数学 · 数学 2009-09-25 Jonathan David Farley

Let $d\ge 3$ be a fixed integer. Let $y:= y(p)$ be the probability that the root of an infinite $d$-regular tree belongs to an infinite cluster after $p$-bond-percolation. We show that for every constants $b,\alpha>0$ and $1<\lambda< d-1$,…

组合数学 · 数学 2024-09-10 Sahar Diskin , Michael Krivelevich

An old conjecture of Graham stated that if $n$ is a prime and $S$ is a sequence of $n$ terms from the cyclic group $C_n$ such that all (nontrivial) zero-sum subsequences have the same length, then $S$ must contain at most two distinct…

组合数学 · 数学 2009-03-19 David J. Grynkiewicz

An $integral$ of a group $G$ is a group $H$ whose derived group (commutator subgroup) is isomorphic to $G$. This paper discusses integrals of groups, and in particular questions about which groups have integrals and how big or small those…

群论 · 数学 2018-08-24 João Araújo , Peter J. Cameron , Carlo Casolo , Francesco Matucci

Given a positive integer $u$ and a simple algebraic group $G$ defined over an algebraically closed field $K$ of characteristic $p$, we derive properties about the subvariety $G_{[u]}$ of $G$ consisting of elements of $G$ of order dividing…

群论 · 数学 2017-06-07 Claude Marion

In 1878, Jordan proved that if a finite group $G$ has a faithful representation of dimension $n$ over $\mathbb{C}$, then $G$ has a normal abelian subgroup with index bounded above by a function of $n$. The same result fails if one replaces…

群论 · 数学 2021-10-28 Gareth Tracey

We explore a paradigm which ties together seemingly disparate areas in number theory, additive combinatorics, and geometric combinatorics including the classical Waring problem, the Furstenberg-S\'{a}rk\"{o}zy theorem on squares in sets of…

组合数学 · 数学 2018-08-22 David Covert , Yeşim Demiroğlu Karabulut , Jonathan Pakianathan

In this article, we discuss the notion of partition of elements in an arbitrary Coxeter system $(W,S)$: a partition of an element $w$ is a subset $\mathcal P\subseteq W$ such that the left inversion set of $w$ is the disjoint union of the…

组合数学 · 数学 2026-03-13 Christophe Hohlweg , Viviane Pons

Let $S_n$ denote the symmetric group on $n$ elements, and $\Sigma\subseteq S_{n}$ a symmetric subset of permutations. Aldous' spectral gap conjecture, proved by Caputo, Liggett and Richthammer [arXiv:0906.1238], states that if $\Sigma$ is a…

群论 · 数学 2020-10-14 Ori Parzanchevski , Doron Puder

Let $\Gamma$ be a Zariski-dense subgroup of a reductive group $\mathbf{G}$ defined over a field $F$. Given a finite collection of finite subgroups $H_i$ ($i \in I$) of $\mathbf{G}(F)$ avoiding the center, we establish a criterion to ensure…

群论 · 数学 2025-10-29 Geoffrey Janssens , Doryan Temmerman , François Thilmany

Let $\Gamma$ be a $G$-symmetric graph with vertex set $V$. We suppose that $V$ admits a $G$-partition $\mathcal{B} = \{ B_0, ... , B_b \}$, with parts of size $v$, and that the quotient graph induced on $\mathcal B$ is a complete graph of…

组合数学 · 数学 2017-09-06 A. Gardiner , Cheryl E. Praeger

We consider the following question by Balister, Gy\H{o}ri and Schelp: given $2^{n-1}$ nonzero vectors in $\mathbb{F}_2^n$ with zero sum, is it always possible to partition the elements of $\mathbb{F}_2^n$ into pairs such that the difference…

组合数学 · 数学 2024-09-04 Benedek Kovács

Let $G$ be a finite group and $\sigma_1(G)=\frac{1}{|G|}\sum_{H\leq G}\,|H|$. Under some restrictions on the number of conjugacy classes of (non-normal) maximal subgroups of $G$, we prove that if $\sigma_1(G)<\frac{117}{20}\,$, then $G$ is…

群论 · 数学 2024-09-23 Marius Tărnăuceanu

This paper deals with combinatorial aspects of finite covers of groups by cosets or subgroups. Let $a_1G_1,...,a_kG_k$ be left cosets in a group $G$ such that ${a_iG_i}_{i=1}^k$ covers each element of $G$ at least $m$ times but none of its…

群论 · 数学 2007-05-23 Zhi-Wei Sun

We show that for any natural number $s$, there is a constant $\gamma$ and a subgraph-closed class having, for any natural $n$, at most $\gamma^n$ graphs on $n$ vertices up to isomorphism, but no adjacency labeling scheme with labels of size…

We consider the fragment F of first order arithmetic in which quantification is restricted to ''for all but finitely many.'' We show that the integers form an F-elementary substructure of the real numbers. Consequently, the F-theory of…

逻辑 · 数学 2007-05-23 David Marker , Theodore A. Slaman

We introduce the notion of set-decomposition of a normal G-flat chain. We show that any normal rectifiable $G$-flat chain admits a decomposition in set-indecomposable sub-chains. This generalizes the decomposition of sets of finite…

偏微分方程分析 · 数学 2024-11-05 Michael Goldman , Benoît Merlet

Let $G$ be a finite group and $\sigma_1(G)=\frac{1}{|G|}\sum_{H\leq G}\,|H|$. In this note, we prove that if $\sigma_1(G)<\frac{117}{20}$, then $G$ is solvable. Moreover, we have $\sigma_1(G)=\frac{117}{20}$ if and only if $G\cong A_5$.…

群论 · 数学 2019-08-13 Marius Tărnăuceanu

Choose a polynomial $f$ uniformly at random from the set of all monic polynomials of degree $n$ with integer coefficients in the box $[-L,L]^n$. The main result of the paper asserts that if $L=L(n)$ grows to infinity, then the Galois group…

数论 · 数学 2024-12-31 Lior Bary-Soroker , Noam Goldgraber

Let $G$ be the group of all order-preserving self-maps of the real line. In previous work, the first two authors constructed a pre-Tannakian category $\underline{\mathrm{Rep}}(G)$ associated to $G$. The present paper is a detailed study of…

表示论 · 数学 2023-01-09 Nate Harman , Andrew Snowden , Noah Snyder