English
Related papers

Related papers: Weak Sequenceability in Cyclic Groups

200 papers

In this short note we extend some results obtained in \cite{Gazaki2015}. First, we prove that for an abelian variety $A$ with good ordinary reduction over a finite extension of $\mathbb{Q}_p$ with $p$ an odd prime, the Albanese kernel of…

Algebraic Geometry · Mathematics 2018-11-19 Evangelia Gazaki

Generalizing results from \cite{DTk,DU} we study the fine structure of locally minimal (locally) precompact Abelian groups (these are the locally essential subgroups $G$ of LCA groups $L$, i.e., such that $G$ non-trivially meets all…

Group Theory · Mathematics 2025-10-21 Dikran Dikranjan , Wei He , Dekui Peng

We prove the Alperin-McKay Conjecture for all $p$-blocks of finite groups with metacyclic, minimal non-abelian defect groups. These are precisely the metacyclic groups whose derived subgroup have order $p$. In the special case $p=3$, we…

Representation Theory · Mathematics 2014-03-21 Benjamin Sambale

A $(v,k,\lambda, \mu)$-partial difference set (PDS) is a subset $D$ of a group $G$ such that $|G| = v$, $|D| = k$, and every nonidentity element $x$ of $G$ can be written in either $\lambda$ or $\mu$ different ways as a product $gh^{-1}$,…

Combinatorics · Mathematics 2023-07-31 James Davis , John Polhill , Ken Smith , Eric Swartz

Given a finite abelian group $G$ and cyclic subgroups $A$, $B$, $C$ of $G$ of the same order, we find necessary and sufficient conditions for $A$, $B$, $C$ to admit a common transversal for the cosets they afford. For an arbitrary number of…

Group Theory · Mathematics 2025-02-21 Stefanos Aivazidis , Maria Loukaki , Benjamin Sambale

The enumeration of zero-sum subsequences of a given sequence over finite cyclic groups is one classical topic, which starts from one question of P. Erd\H{o}s. In this paper, we consider this problem in a more general setting -- finite…

Combinatorics · Mathematics 2025-05-02 Guoqing Wang , Yang Zhao , Xingliang Yi

For a weight-set $A\subseteq \mathbb Z_n$, the $A$-weighted zero-sum constant $C_A(n)$ is defined to be the smallest natural number $k$, such that any sequence of $k$ elements in $\mathbb Z_n$ has an $A$-weighted zero-sum subsequence of…

Number Theory · Mathematics 2022-12-13 Santanu Mondal , Krishnendu Paul , Shameek Paul

We say that finite groups are isospectral if they have the same sets of orders of elements. It is known that every nonsolvable finite group $G$ isospectral to a finite simple group has a unique nonabelian composition factor, that is, the…

Group Theory · Mathematics 2022-07-07 Maria A. Grechkoseeva , Andrey V. Vasil'ev

The constant $C_A(n)$ is defined to be the smallest natural number $k$ such that any sequence of $k$ elements in $\mathbb Z_n$ has a subsequence of consecutive terms whose $A$-weighted sum is zero, where the weight set $A\subseteq \mathbb…

Number Theory · Mathematics 2022-10-25 Santanu Mondal , Krishnendu Paul , Shameek Paul

Let $G$ be a connected semi-simple group defined over and algebraically closed field, $T$ a fixed Cartan, $B$ a fixed Borel containing $T$, $S$ a set of simple reflections associated to the simple positive roots corresponding to $(T,B)$,…

Algebraic Geometry · Mathematics 2007-05-23 David Joyner , Pablo Lejarraga

A graph is called set-sequential if its vertices can be labeled with distinct nonzero vectors in $\mathbb{F}_2^n$ such that when each edge is labeled with the sum$\pmod{2}$ of its vertices, every nonzero vector in $\mathbb{F}_2^n$ is the…

Combinatorics · Mathematics 2017-10-17 Louis Golowich , Chiheon Kim

Let alpha = a_1 a_2 ... a_n be a sequence of nonnegative integers. The ascent set of alpha, Asc(alpha), consists of all indices k where a_{k+1} > a_k. An ascent sequence is alpha where the growth of the a_k is bounded by the elements of…

Combinatorics · Mathematics 2023-11-28 Mark Dukes , Bruce Sagan

A recent result of Balandraud shows that for every subset S of an abelian group G, there exists a non trivial subgroup H such that |TS| <= |T|+|S|-2 holds only if the stabilizer of TS contains H. Notice that Kneser's Theorem says only that…

Number Theory · Mathematics 2008-10-20 Yahya Ould Hamidoune , Oriol Serra , Gilles Zemor

Consider the random Cayley graph of a finite group $G$ with respect to $k$ generators chosen uniformly at random, with $1 \ll \log k \ll \log |G|$; denote it $G_k$. A conjecture of Aldous and Diaconis (1985) asserts, for $k \gg \log |G|$,…

Probability · Mathematics 2025-10-14 Jonathan Hermon , Sam Olesker-Taylor

Let $G$ be a finite group, $S\subseteq G\setminus\{1\}$ be a set such that if $a\in S$, then $a^{-1}\in S$, where $1$ denotes the identity element of $G$. The undirected Cayley graph $Cay(G,S)$ of $G$ over the set $S$ is the graph whose…

Combinatorics · Mathematics 2014-02-12 Alireza Abdollahi , Mojtaba Jazaeri

When one studies the structure (e.g. graded ideals, graded subspaces, radicals, ...) or graded polynomial identities of graded algebras, the grading group itself does not play an important role, but can be replaced by any other group that…

Rings and Algebras · Mathematics 2018-05-14 Alexey Gordienko , Ofir Schnabel

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…

General Mathematics · Mathematics 2007-05-23 Jean-François Caillot , Friedrich Wehrung

Let $G$ be an additive finite abelian group with exponent $\exp(G)$. For $L\subseteq \mathbb N$, let $\mathsf{s}_{L}(G)$ be the smallest integer $\ell$ such that every sequence $S$ over $G$ of length $\ell$ has a zero-sum subsequence $T$ of…

Combinatorics · Mathematics 2023-10-10 Shiwen Zhang

Let $\beta>0$. Motivated by jumbled graphs defined by Thomason, the celebrated expander mixing lemma and Haemers's vertex separation inequality, we define that a graph $G$ with $n$ vertices is a weakly $(n,\beta)$-graph if $\frac{|X|…

Combinatorics · Mathematics 2022-05-31 Xiaofeng Gu , Muhuo Liu

A walk $u_0u_1 \ldots u_{k-1}u_k$ of a graph $G$ is a \textit{weakly toll walk} if $u_0u_k \not\in E(G)$, $u_0u_i \in E(G)$ implies $u_i = u_1$, and $u_ju_k\in E(G)$ implies $u_j=u_{k-1}$. The {\em weakly toll interval} of a set $S…

Combinatorics · Mathematics 2023-03-15 Mitre C. Dourado , Marisa Gutierrez , Fábio Protti , Silvia Tondato
‹ Prev 1 8 9 10 Next ›