English
Related papers

Related papers: On the index conjecture in zero-sum theory: singul…

200 papers

Let A,B,S be finite subsets of an abelian group G. Suppose that the restricted sumset C={a+b: a in A, b in B, and a-b not in S} is nonempty and some c in C can be written as a+b with a in A and b in B in at most m ways. We show that if G is…

Combinatorics · Mathematics 2007-05-23 Hao Pan , Zhi-Wei Sun

The Sendov conjecture asserts that if all the zeros of a polynomial p lie in the closed unit disk then there must be a zero of p ' within unit distance of each zero. In this paper we give a partial result when p has simple zeros.

Classical Analysis and ODEs · Mathematics 2018-05-16 Robert Dalmasso

Let $(G, 1_G)$ be a finite group and let $S=g_1\bdot \ldots\bdot g_{\ell}$ be a nonempty sequence over $G$. We say $S$ is a tiny product-one sequence if its terms can be ordered such that their product equals $1_G$ and…

Number Theory · Mathematics 2020-02-28 Qinghai Zhong

Let $G$ be a graph. A subset $D \subseteq V(G)$ is called a 1-isolating set of $G$ if $\Delta(G-N[D]) \leq 1$, that is, $G-N[D]$ consists of isolated edges and isolated vertices only. The $1$-isolation number of $G$, denoted by…

Combinatorics · Mathematics 2023-08-02 Yirui Huang , Gang Zhang , Xian'an Jin

Graham conjectured in 1971 that for any prime $p$, any subset $S\subseteq \mathbb{Z}_p\setminus \{0\}$ admits an ordering $s_1,s_2,\dots,s_{|S|}$ where all partial sums $s_1, s_1+s_2,\dots,s_1+s_2+\dots+s_{|S|}$ are distinct. We prove this…

Combinatorics · Mathematics 2026-02-18 Huy Tuan Pham , Lisa Sauermann

Let $G$ be a finite additive abelian group with exponent $n$ and $S=g_{1}\cdots g_{t}$ be a sequence of elements in $G$. For any element $g$ of $G$ and $A\subseteq\{1,2,\ldots,n-1\}$, let $N_{A,g}(S)$ denote the number of subsequences…

Number Theory · Mathematics 2019-01-04 Abílio Lemos , Allan O. Moura , Anderson T. Silva , B. K. Moriya

In this paper, we are motivated by two conjectures proposed by C. Bender et al.\ in 2024, which have remained open questions. The first conjecture states that if the complemented zero-divisor graph \( G(S) \) of a commutative semigroup \( S…

Combinatorics · Mathematics 2025-06-23 Anagha Khiste , Ganesh Tarte , Vinayak Joshi

The $S$-adic conjecture claims that there exists a condition $C$ such that a sequence has a sub-linear complexity if and only if it is an $S$-adic sequence satisfying Condition $C$ for some finite set $S$ of morphisms. We present an…

Discrete Mathematics · Computer Science 2012-09-03 Fabien Durand , Julien Leroy , Gwénaël Richomme

The simplest case of a manifold with singularities is a manifold M with boundary, together with an identification of the boundary with a product M1 x P, where P is a fixed manifold. The associated singular space is obtained by collapsing P…

Differential Geometry · Mathematics 2011-03-10 Jonathan Rosenberg

Given a finite nonempty sequence of integers S, by grouping adjacent terms it is always possible to write it, possibly in many ways, as S = X Y^k, where X and Y are sequences and Y is nonempty. Choose the version which maximizes the value…

Combinatorics · Mathematics 2013-02-19 Benjamin Chaffin , N. J. A. Sloane

Let $R$ be a ring with identity and $I(X,R)$ be the incidence algebra of a locally finite partially ordered set $X$ over $R.$ In this paper, we compute the socle and the singular ideal of the incidence ring for some $X$ in terms of the…

Rings and Algebras · Mathematics 2020-12-29 Muge Kanuni , Ozkay Ozkan

A clutter is \emph{$k$-wise intersecting} if every $k$ members have a common element, yet no element belongs to all members. We conjecture that, for some integer $k\geq 4$, every $k$-wise intersecting clutter is non-ideal. As evidence for…

Combinatorics · Mathematics 2020-10-06 Ahmad Abdi , Gérard Cornuéjols , Tony Huynh , Dabeen Lee

The general {\bf surface group conjecture} asks whether a one-relator group where every subgroup of finite index is again one-relator and every subgroup of infinite index is free (property IF) is a surface group. We resolve several related…

Group Theory · Mathematics 2012-08-21 Laura Ciobanu , Ben Fine , Gerhard Rosenberger

Let G be any group and $a_1G_1,...,a_kG_k (k>1)$ be left cosets in G. In 1974 Herzog and Sch\"onheim conjectured that if $\Cal A=\{a_iG_i\}_{i=1}^k$ is a partition of G then the (finite) indices $n_1=[G:G_1],...,n_k=[G:G_k]$ cannot be…

Group Theory · Mathematics 2007-05-23 Zhi-Wei Sun

A conjugacy class $C$ of a finite group $G$ is a sign conjugacy class if every irreducible character of $G$ takes value 0, 1 or -1 on $C$. In this paper we classify the sign conjugacy classes of the symmetric groups and thereby verify a…

Combinatorics · Mathematics 2015-11-24 Lucia Morotti

In this note we provide some counterexamples for the conjectures of finite simple groups, one of the conjectures said "all finite simple groups $G$ can be determined using their orders $|G|$ and the number of elements of order $p$, where…

Group Theory · Mathematics 2018-10-10 Wujie Shi

In this paper, we prove a tight minimum degree condition in general graphs for the existence of paths between two given endpoints, whose lengths form a long arithmetic progression with common difference one or two. This allows us to obtain…

Combinatorics · Mathematics 2021-01-27 Jun Gao , Qingyi Huo , Chun-Hung Liu , Jie Ma

We prove an old conjecture of Erd{\H o}s and Graham on sums of unit fractions: There exists a constant $b>0$ such that if we $r$-color the integers in $2,b^r]$, then there exists a monochromatic set $S$ such that $\sum_{n \in S} 1/n=1$.

Number Theory · Mathematics 2007-05-23 Ernest S. Croot

Denote by $G$ a finite group and by $\psi(G)$ the sum of element orders in $G$. If $t$ is a positive integer, denote by $C_t$ the cyclic group of order $t$ and write $\psi(t)=\psi(C_t)$. In this paper we proved the following Theorem A: Let…

Group Theory · Mathematics 2019-05-30 Marcel Herzog , Patrizia Longobardi , Mercede Maj

We prove a conjecture that classifies exceptional numbers. This conjecture arises in two different ways, from cryptography and from coding theory. An odd integer $t\geq 3$ is said to be exceptional if $f(x)=x^t$ is APN (Almost Perfect…

Information Theory · Computer Science 2024-05-01 Fernando Hernando , Gary McGuire