English
Related papers

Related papers: Weak Sequenceability in Cyclic Groups

200 papers

Let A be an abelian variety over a number field k. We show that weak approximation holds in the Weil-Ch\^atelet group of A/k but that it may fail when one restricts to the n-torsion subgroup. This failure is however relatively mild; we show…

Number Theory · Mathematics 2015-12-18 Brendan Creutz

Let $\Gamma$ be an abelian group and $g \geq h \geq 2$ be integers. A set $A \subset \Gamma$ is a $C_h[g]$-set if given any set $X \subset \Gamma$ with $|X| = k$, and any set $\{ k_1 , \dots , k_g \} \subset \Gamma$, at least one of the…

Combinatorics · Mathematics 2013-11-14 Xing Peng , Rafael Tesoro , Craig Timmons

Suppose $G$ is a finite abelian group and $S$ is a sequence of elements in $G$. For any element $g$ of $G$, let $N_g(S)$ denote the number of subsequences of $S$ with sum $g$. The purpose of this paper is to investigate the lower bound for…

Combinatorics · Mathematics 2011-01-25 Gerard Jennhwa Chang , Sheng-Hua Chen , Yongke Qu , Guoqing Wang , Haiyan Zhang

For varieties over global fields, weak approximation in the space of adelic points can fail. For a subvariety of an abelian variety one expects this failure is always explained by a finite descent obstruction, in the sense that the rational…

Number Theory · Mathematics 2023-09-11 Brendan Creutz

We consider the random Cayley graphs of a sequence of finite nilpotent groups of diverging sizes $G=G(n)$, whose ranks and nilpotency classes are uniformly bounded. For some $k=k(n)$ such that $1\ll\log k \ll \log |G|$, we pick a random set…

Probability · Mathematics 2024-03-20 Jonathan Hermon , Xiangying Huang

Metacirculants are a basic and well-studied family of vertex-transitive graphs, and weak metacirculants are generalizations of them. A graph is called a weak metacirculant if it has a vertex-transitive metacyclic automorphism group. This…

Combinatorics · Mathematics 2017-11-21 Jin-Xin Zhou , Sanming Zhou

A partial $(n,k,t)_\lambda$-system is a pair $(X,\mathcal{B})$ where $X$ is an $n$-set of vertices and $\mathcal{B}$ is a collection of $k$-subsets of $X$ called blocks such that each $t$-set of vertices is a subset of at most $\lambda$…

Combinatorics · Mathematics 2023-11-23 Daniel Horsley , Padraig Ó Catháin

We consider the question of when a random walk on a finite abelian group with a given step distribution can be used to reconstruct a binary labeling of the elements of the group, up to a shift. Matzinger and Lember (2006) give a sufficient…

Probability · Mathematics 2014-05-01 Hilary Finucane , Omer Tamuz , Yariv Yaari

In this paper, poor abelian groups are characterized. It is proved that an abelian group is poor if and only if its torsion part contains a direct summand isomorphic to $\oplus_{p \in P} \Z_p$, where $P$ is the set of prime integers. We…

Rings and Algebras · Mathematics 2015-07-07 Rafail Alizade , Engin Buyukasik

A result of Pyber states that every finite group $G$ contains an abelian subgroup whose order is quasi-polynomially large in $\lvert G\rvert$. We prove a similar result for $K$-approximate subgroups of solvable groups under only modest…

Combinatorics · Mathematics 2025-12-18 Carl Schildkraut

We say that an infinite word w is weak abelian periodic if it can be factorized into finite words with the same frequencies of letters. In the paper we study properties of weak abelian periodicity, its relations with balance and frequency.…

Combinatorics · Mathematics 2013-02-19 Sergey Avgustinovich , Svetlana Puzynina

A graph $G$ is {\it weakly semiregular} if there are two numbers $a,b$, such that the degree of every vertex is $a$ or $b$. The {\it weakly semiregular number} of a graph $G$, denoted by $wr(G)$, is the minimum number of subsets into which…

Combinatorics · Mathematics 2017-01-24 Arash Ahadi , Ali Dehghan , Mohsen Mollahajiaghaei

Metacirculants are a rich resource of many families of interesting graphs, and weak metacirculants are generalizations of them. A graph is called a {\em split weak metacirculant} if it has a vertex-transitive split metacyclic automorphism…

Combinatorics · Mathematics 2018-10-04 Li Cui , Jin-Xin Zhou

Based on the concept of weakly meet $s_{Z}$-continuouity put forward by Xu and Luo in \cite{qzm}, we further prove that if the subset system $Z$ satisfies certain conditions, a poset is $s_{Z}$-continuous if and only if it is weakly meet…

General Topology · Mathematics 2023-06-22 Huijun Hou , Qingguo Li

We study a generalization of strongly regular graphs. We call a graph strongly walk-regular if there is an $\ell >1$ such that the number of walks of length $\ell$ from a vertex to another vertex depends only on whether the two vertices are…

Combinatorics · Mathematics 2013-01-31 Edwin R. van Dam , Gholamreza Omidi

A graph $\Gamma$ is said to be unstable if for the direct product $\Gamma \times K_2$, $Aut(\Gamma \times K_2)$ is not isomorphic to $Aut(\Gamma) \times \mathbb{Z}_2$. In this paper we show that a connected and non-bipartite Cayley graph…

Combinatorics · Mathematics 2025-07-09 Ademir Hujdurović , István Kovács

We introduce the vertex-arboricity of group-labelled graphs. For an abelian group $\Gamma$, a $\Gamma$-labelled graph is a graph whose edges are labelled by elements of $\Gamma$. For an abelian group $\Gamma$ and $A\subseteq \Gamma$, the…

Combinatorics · Mathematics 2023-05-03 O-joung Kwon , Xiaopan Lian

Let $[n]$ (resp. $V$) be an $n$-element set (resp. $n$-dimensional vector space over the finite field $\mathbb{F}_{q}$), and $\binom{[n]}{k}$ (resp. $\genfrac{[}{]}{0pt}{}{V}{k}$) denote the set of all $k$-subsets of $[n]$ (resp.…

Combinatorics · Mathematics 2026-05-25 Shuhui Yu , Lijun Ji

The power graph and the enhanced power graph of a group $\mathbf G$ are simple graphs with vertex set $G$; two elements of $G$ are adjacent in the power graph if one of them is a power of the other, and they are adjacent in the enhanced…

Combinatorics · Mathematics 2024-04-30 Ivica Bošnjak , Rozália Madarász , Samir Zahirović

We investigate subsets with small sumset in arbitrary abelian groups. For an abelian group $G$ and an $n$-element subset $Y \subseteq G$ we show that if $m \ll s^2/(\log n)^2$, then the number of subsets $A \subseteq Y$ with $|A| = s$ and…

Combinatorics · Mathematics 2025-04-15 Dingyuan Liu , Letícia Mattos , Tibor Szabó
‹ Prev 1 4 5 6 7 8 10 Next ›