相关论文: Improved lower bound on generalized Erdos-Ginzburg…

A well-known result of Tutte says that if Gamma is an Abelian group and G is a graph having a nowhere-zero Gamma-flow, then G has a nowhere-zero Gamma'-flow for each Abelian group Gamma' whose order is at least the order of Gamma. Jaeger,…

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…

Let $G$ be a finite abelian group with exponent $n$. Let $\eta(G)$ denote the smallest integer $\ell$ such that every sequence over $G$ of length at least $\ell$ has a zero-sum subsequence of length at most $n$. We determine the precise…

For a graph $G$, a vertex subset $S$ is called a maximum generalized $k$-independent set if the induced subgraph $G[S]$ does not contain a $k$-tree as its subgraph, and the subset has maximum cardinality. The generalized $k$-independence…

Let $G$ be a graph of order $n$ with eigenvalues $\lambda_1 \geq \cdots \geq\lambda_n$. Let \[s^+(G)=\sum_{\lambda_i>0} \lambda_i^2, \qquad s^-(G)=\sum_{\lambda_i<0} \lambda_i^2.\] The smaller value, $s(G)=\min\{s^+(G), s^-(G)\}$ is called…

Let $k$ be a number field. We provide an asymptotic formula for the number of Galois extensions of $k$ with absolute discriminant bounded by some $X \geq 1$, as $X\to\infty$. We also provide an asymptotic formula for the closely related…

Let $G\cong \mathbb Z/m_1\mathbb Z\times\ldots\times \mathbb Z/m_r\mathbb Z$ be a finite abelian group with $m_1\mid\ldots\mid m_r=\exp(G)$. The $n$-term subsums version of Kneser's Theorem, obtained either via the DeVos-Goddyn-Mohar…

Let $G$ be a finite additive abelian group. For given $k$ a positive integer, the $k$-Harborth constant $g^k(G)$ is defined to be the smallest positive integer $t$ such that given a set $S$ of elements of $G$ with size $t$ there exists a…

For a set of permutations (patterns) $\Pi$ in $S_k$, consider the set of all permutations in $S_n$ that avoid all patterns in $\Pi$. An important problem in current algebraic combinatorics is to find pattern sets $\Pi$ such that the…

It has been recently proved (by Croot, Lev and Pach and the subsequent work by Ellenberg and Gijswijt) that for a group $G=G_0^n$, where $G_0\ne \{1,-1\}^m$ is a fixed finite Abelian group and $n$ is large, any subset $A$ without…

We investigate the group irregularity strength ($s_g(G)$) of graphs, i.e. the smallest value of $s$ such that taking any Abelian group $\gr$ of order $s$, there exists a function $f:E(G)\rightarrow \gr$ such that the sums of edge labels at…

Let $G$ be a graph on $n$ vertices and $(H,+)$ be an abelian group. What is the minimum size ${\sf S}_H(G)$ of the set of all sums $A(u)+A(v)$ over all injections $A:V(G)\to H$? In 2012, the first author, Angel, the second author, and…

We describe the subgroups of the group $\Z_m \times \Z_n \times \Z_r$ and derive a simple formula for the total number $s(m,n,r)$ of the subgroups, where $m,n,r$ are arbitrary positive integers. An asymptotic formula for the function…

The Harborth constant of a finite group $G$, denoted $\gs(G)$, is the smallest integer $k$ such that the following holds: For $A\subseteq G$ with $|A|=k$, there exists $B\subseteq A$ with $|B|=\exp(G)$ such that the elements of $B$ can be…

For a finite Abelian group $(\Gamma,+)$, let $n(\Gamma)$ denote the smallest positive integer $n$ such that for each labelling of the arcs of the complete digraph of order $n$ using elements from $\Gamma$, there exists a directed cycle such…

For a finite abelian group $G$ written additively, and a non-empty subset $A\subset [1,\exp(G)-1]$ the weighted Davenport Constant of $G$ with respect to the set $A$, denoted $D_A(G)$, is the least positive integer $k$ for which the…

Let $f(N)$ denote the least integer $k$ such that, if $G$ is an abelian group of order $N$ and $A \subseteq G$ is a uniformly random $k$-element subset, then with probability at least $\tfrac12$ the subset-sum set $\{ \sum_{x \in S} x : S…

An open problem that is widely regarded as one of the most important in quantum query complexity is to resolve the quantum query complexity of the k-distinctness function on inputs of size N. While the case of k=2 (also called Element…

A permutation $\sigma\in S_n$ is said to be $k$-universal or a $k$-superpattern if for every $\pi\in S_k$, there is a subsequence of $\sigma$ that is order-isomorphic to $\pi$. A simple counting argument shows that $\sigma$ can be a…

Let $G$ be a $\sigma$-finite abelian group, i.e. $G=\bigcup_{n\geq 1} G_n$ where $(G_n)_{n\geq 1}$ is a non decreasing sequence of finite subgroups. For any $A\subset G$, let $\underline{\mathrm{d}}(A):=\liminf_{n\to\infty}\frac{|A\cap…