中文
相关论文

相关论文: Veech's theorem of higher order

200 篇论文

We prove a conjecture due to Baumgaertel and Lledo according to which for every compact group G one has Z(G)^ \cong C(G), where the `chain group' C(G) is the free abelian group (written multiplicatively) generated by the set G^ of…

群论 · 数学 2007-05-23 Michael Mueger

Let $G$ be a finite abelian group of order $n$. For any subset $B$ of $G$ with $B=-B$, the Cayley graph $G_B$ is a graph on vertex set $G$ in which $ij$ is an edge if and only if $i-j\in B.$ It was shown by Ben Green that when $G$ is a…

数论 · 数学 2009-05-20 Gyan Prakash

Let $\psi(G) = \sum_{g \in G} o(g)$ denote the sum of element orders of a finite group $G$. It is known that among groups of order $n$, the cyclic group $C_n$ maximizes $\psi$. T\u{a}rn\u{a}uceanu proved that two finite abelian $p$-groups…

群论 · 数学 2026-05-12 Mohsen Amiri

We prove that if $G$ is an abelian group and $H_1x_1,\dots,H_{k}x_k$ is an irredundant (minimal) cover of $G$ with cosets, then $$|G:\bigcap_{i=1}^{k}H_{i}|=2^{O(k)}.$$ This bound is the best possible up to the constant hidden in the…

组合数学 · 数学 2022-11-01 János Nagy , Péter Pál Pach , István Tomon

In an earlier work, finite groups whose power graphs are minimally edge connected have been classified. In this article, first we obtain a necessary and sufficient condition for an arbitrary graph to be minimally edge connected.…

群论 · 数学 2024-08-21 Parveen , Manisha , Jitender Kumar

We obtain a polynomial upper bound in the finite-field version of the multidimensional polynomial Szemer\'{e}di theorem for distinct-degree polynomials. That is, if $P_1, ..., P_t$ are nonconstant integer polynomials of distinct degrees and…

数论 · 数学 2021-11-10 Borys Kuca

Consider the random Cayley graph of a finite Abelian group $G$ with respect to $k$ generators chosen uniformly at random, with $1 \ll \log k \ll \log |G|$. Draw a vertex $U \sim \operatorname{Unif}(G)$. We show that the graph distance…

概率论 · 数学 2025-10-14 Jonathan Hermon , Sam Olesker-Taylor

Let G be an abelian group. For a subset A of G, Cyc(A) denotes the set of all elements x of G such that the cyclic subgroup generated by x is contained in A, and G is said to have the small subgroup generating property (abbreviated to SSGP)…

一般拓扑 · 数学 2018-12-27 Dmitri Shakhmatov , Víctor Hugo Yañez

We prove that for a finitely generated infinite nilpotent group G with a first order structure (G,*,...), the connected component G*0 of a sufficiently saturated extension G* of G exists and equals $\bigcap_{n\in\N} {g^n : g\in G^*}$. We…

逻辑 · 数学 2012-09-05 Nathan Bowler , Cong Chen , Jakub Gismatullin

A first order expansion of $(\mathbb{R},+,<)$ is dp-minimal if and only if it is o-minimal. We prove analogous results for algebraic closures of finite fields, $p$-adic fields, ordered abelian groups with only finitely many convex subgroups…

逻辑 · 数学 2026-02-11 Pierre Simon , Erik Walsberg

Let $G$ be a finite $p$-group of order $p^n$. YA. G. Berkovich (Journal of Algebra {\bf 144}, 269-272 (1991)) proved that $G$ is elementary abelian $p$-group if and only if the order of its Schur multiplier, $M(G)$, is at the maximum case.…

群论 · 数学 2011-03-31 Behrooz Mashayekhy , Mahboobeh Alizadeh Sanati

For an infinite discrete group $G$ acting on a compact metric space $X$, we introduce several weak versions of equicontinuity along subsets of $G$ and show that if a minimal system $(X,G)$ admits an invariant measure then $(X,G)$ is distal…

动力系统 · 数学 2023-11-14 Jian Li , Yini Yang

Let $G$ be a multiplicatively written finite group. We denote by $\mathsf E(G)$ the smallest integer $t$ such that every sequence of $t$ elements in $G$ contains a product-one subsequence of length $|G|$. In 1961, Erd\H{o}s, Ginzburg and…

组合数学 · 数学 2021-07-21 Yongke Qu , Yuanlin Li

Let $G$ be a finite abelian group and $p$ be the smallest prime dividing $|G|$. Let $S$ be a sequence over $G$. We say that $S$ is regular if for every proper subgroup $H \subsetneq G$, $S$ contains at most $|H|-1$ terms from $H$. Let…

组合数学 · 数学 2021-12-07 Weidong Gao , Yuanlin Li , Yongke Qu , Qinghong Wang

Let $A$ be a nonempty subset of finite abelian group $G$ of order $n$. For an integer $h \geq 2$, the restricted $h$-fold sumset $h^\wedge A$ is the set of all sums of $h$ distinct elements of $A$. It is known that if $G$ is a group of…

数论 · 数学 2026-05-26 Vivekanand Goswami , Raj Kumar Mistri

In this paper, it is shown that for a minimal system $(X,T)$ and $d,k\in \mathbb{N}$, if $(x,x_i)$ is regionally proximal of order $d$ for $1\leq i\leq k$, then $(x,x_1,\ldots,x_k)$ is $(k+1)$-regionally proximal of order $d$. Meanwhile, we…

动力系统 · 数学 2021-07-27 Jiahao Qiu

We study notions such as &#64257;nite presentability and coherence, for partially ordered abelian groups and vector spaces. Typical results are the following: (i) A partially ordered abelian group G is &#64257;nitely presented if and only…

综合数学 · 数学 2007-05-23 Jean-François Caillot , Friedrich Wehrung

Let $\{X(t):t\in\mathbb R_+\}$ be a stationary Gaussian process with almost surely (a.s.) continuous sample paths, $\mathbb E X(t) = 0$, $\mathbb E X^2(t) = 1$ and correlation function satisfying (i) $r(t) = 1 - C|t|^{\alpha} +…

概率论 · 数学 2018-03-05 K. Dębicki , K. M. Kosiński

The \textbf{Co-Prime Order Graph} $\Theta (G)$ of a given finite group is a simple undirected graph whose vertex set is the group $G$ itself, and any two vertexes x,y in $\Theta (G)$ are adjacent if and only if $gcd(o(x),o(y))=1$ or prime.…

群论 · 数学 2021-06-17 Amit Sehgal , Manjeet , Dalip Singh

A classical problem, raised by Fuchs in 1960, asks to classify the abelian groups which are groups of units of some rings. In this paper, we consider the case of finitely generated abelian groups, solving Fuchs' problem for such group with…

交换代数 · 数学 2024-06-04 I. Del Corso , L. Stefanello