Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > math > arXiv:2306.02721v2

Help | Advanced Search

Mathematics > Combinatorics

arXiv:2306.02721v2 (math)
[Submitted on 5 Jun 2023 (v1) , last revised 14 Feb 2024 (this version, v2)]

Title: Alternating Parity Weak Sequencing

Title: 交替奇偶弱序列

Authors:Simone Costa, Stefano Della Fiore
Abstract: A subset $S$ of a group $(G,+)$ is $t$-weakly sequenceable if there is an ordering $(y_1, \ldots, y_k)$ of its elements such that the partial sums~$s_0, s_1, \ldots, s_k$, given by $s_0 = 0$ and $s_i = \sum_{j=1}^i y_j$ for $1 \leq i \leq k$, satisfy $s_i \neq s_j$ whenever and $1 \leq |i-j|\leq t$. In [10] it was proved that if the order of a group is $pe$ then all sufficiently large subsets of the non-identity elements are $t$-weakly sequenceable when $p > 3$ is prime, $e \leq 3$ and $t \leq 6$. Inspired by this result, we show that, if $G$ is the semidirect product of $\mathbb{Z}_p$ and $\mathbb{Z}_2$ and the subset $S$ is balanced, then $S$ admits, regardless of its size, an alternating parity $t$-weak sequencing whenever $p > 3$ is prime and $t \leq 8$. A subset of $G$ is balanced if it contains the same number of even elements and odd elements and an alternating parity ordering alternates even and odd elements. Then using a hybrid approach that combines both Ramsey theory and the probabilistic method we also prove, for groups $G$ that are semidirect products of a generic (non necessarily abelian) group $N$ and $\mathbb{Z}_2$, that all sufficiently large balanced subsets of the non-identity elements admit an alternating parity $t$-weak sequencing. The same procedure works also for studying the weak sequenceability for generic sufficiently large (not necessarily balanced) sets. Here we have been able to prove that, if the size of a subset $S$ of a group $G$ is large enough and if $S$ does not contain $0$, then $S$ is $t$-weakly sequenceable.
Abstract: 群 $(G,+)$ 的子集 $S$ 如果存在一种元素排列方式 $(y_1, \ldots, y_k)$,使得部分和 $s_0, s_1, \ldots, s_k$,由 $s_0 = 0$ 和 $s_i = \sum_{j=1}^i y_j$ 给出且对于 $1 \leq i \leq k$ 成立时满足 $s_i \neq s_j$ 和 $1 \leq |i-j|\leq t$,则称其为 $t$-弱序列可构造的。 在[10]中证明了,如果一个群的阶为$pe$,那么当$p > 3$是素数时,非单位元的所有足够大的子集在$e \leq 3$和$t \leq 6$条件下都是$t$-弱序列可排列的。 受此结果启发,我们证明了,如果 $G$ 是 $\mathbb{Z}_p$ 和 $\mathbb{Z}_2$ 的半直积,并且子集 $S$ 是平衡的,那么只要 $p > 3$ 是素数且 $t \leq 8$,则无论大小如何,$S$ 都存在交替奇偶性的 $t$-弱序列化。 一个集合 $G$ 是平衡的,当且仅当它包含相同数量的偶数元素和奇数元素,并且交替奇偶性排序交替出现偶数和奇数元素。 然后,利用结合了拉姆齐理论和概率方法的混合方法,我们还证明了对于半直积群 $G$,其中 $N$ 是一个通用的(不必然是阿贝尔群)群,$\mathbb{Z}_2$ 是任意的群,所有足够大的非单位元平衡子集都承认交替奇偶性 $t$-弱序列化。 同样的过程也可以用于研究通用的足够大的(不必然是平衡的)集合的弱序列化问题。 在这里我们已经能够证明,如果一个群 $G$ 的子集 $S$ 的大小足够大,并且如果 $S$ 不包含 $0$,那么 $S$ 是 $t$-弱可序列的。
Subjects: Combinatorics (math.CO)
MSC classes: 05C25, 05C38, 05D40
Cite as: arXiv:2306.02721 [math.CO]
  (or arXiv:2306.02721v2 [math.CO] for this version)
  https://doi.org/10.48550/arXiv.2306.02721
arXiv-issued DOI via DataCite

Submission history

From: Stefano Della Fiore [view email]
[v1] Mon, 5 Jun 2023 09:13:57 UTC (15 KB)
[v2] Wed, 14 Feb 2024 10:01:01 UTC (17 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
license icon view license
Current browse context:
math.CO
< prev   |   next >
new | recent | 2023-06
Change to browse by:
math

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号