惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

博客园 - 【当耐特】
小众软件
小众软件
S
SegmentFault 最新的问题
GbyAI
GbyAI
量子位
爱范儿
爱范儿
L
LangChain Blog
Vercel News
Vercel News
A
About on SuperTechFans
腾讯CDC
博客园_首页
酷 壳 – CoolShell
酷 壳 – CoolShell
月光博客
月光博客
博客园 - 聂微东
Stack Overflow Blog
Stack Overflow Blog
H
Help Net Security
U
Unit 42
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
V
V2EX
V
Visual Studio Blog
美团技术团队
D
DataBreaches.Net
The GitHub Blog
The GitHub Blog
N
Netflix TechBlog - Medium

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Weak multiset sequenceability and weak BHR conjecture
Simone Costa · 2024-03-11 · via math.CO updates on arXiv.org

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 this paper, we consider the weak sequenceability problem on multisets. In particular, we are able to prove that a multiset $M=[a_1^{λ_1},a_2^{λ_2},\dots,a_n^{λ_n}]$ of non-identity elements of a generic group $G$ is $t$-weakly sequenceable whenever the underlying set $\{a_1,a_2,\dots,a_n\}$ is sufficiently large (with respect to $t$) and the smallest prime divisor $p$ of $|G|$ is larger than $t$. A related question is the one posed by the Buratti, Horak, and Rosa (briefly BHR) conjecture here considered again in the weak sense. Given a multiset $M$ and a walk $W$ in $Cay[G: \pm M]$, we say that $W$ is a realization of $M$ if $Δ(W)=\pm M$. Here we prove that a multiset $M=[a_1^{λ_1},a_2^{λ_2},\dots,a_n^{λ_n}]$ of non-identity elements of $G$ admits a realization $W=(w_0,\dots,w_{\ell})$ such that $w_i\neq w_j$ whenever and $1 \leq |i-j|\leq t$ assuming that $|M|=λ_1+λ_2+\dots+λ_n$ is sufficiently large and the smallest prime divisor $p$ of $|G|$ is larger than $t(2t+1)$.