中文
相关论文

相关论文: Upper Bounds for the Davenport Constant

200 篇论文

We improve the previuosly known bound for some vertex Folkman numbers.

组合数学 · 数学 2007-05-23 N. Kolev , N. Nenov

Given an abstract group $G$, we study the function $ab_n(G) := \sup_{|G:H| \leq n} |H/[H,H]|$. If $G$ has no abelian composition factors, then $ab_n(G)$ is bounded by a polynomial: as a consequence, we find a sharp upper bound for the…

群论 · 数学 2022-10-10 Luca Sabatini

The purpose of this paper is to give explicit methods for bounding the number of vertices of finite $k$-regular graphs with given second eigenvalue. Let $X$ be a finite $k$-regular graph and $\mu_1(X)$ the second largest eigenvalue of its…

组合数学 · 数学 2018-10-23 Joseph Richey , Noah Shutty , Matthew Stover

For every prime $p$ and integer $n\ge 3$ we explicitly construct an abelian variety $A/\F_{p^n}$ of dimension $n$ such that for a suitable prime $l$ the group of quasi-isogenies of $A/\F_{p^n}$ of $l$-power degree is canonically a dense…

代数拓扑 · 数学 2014-01-14 Niko Naumann

This paper is mainly devoted to the study of the differentiation index and the order for quasi-regular implicit ordinary differential algebraic equation (DAE) systems. We give an algebraic definition of the differentiation index and prove a…

交换代数 · 数学 2008-11-19 Lisi D'Alfonso , Gabriela Jeronimo , Gustavo Massaccesi , Pablo Solernó

We generalize the Davenport transform and use it to prove that, for a (possibly non-commutative) cancellative semigroup $\mathbb A = (A, +)$ and non-empty subsets $X,Y$ of $A$ such that the subsemigroup generated by $Y$ is commutative, we…

组合数学 · 数学 2015-02-02 Salvatore Tringali

We provide an upper bound on the quasi-relative entropy in terms of the trace distance. The bound is derived for two cases: 1) any operator monotone decreasing function and full rank mixed qubit or classical states; 2) a large class of…

量子物理 · 物理学 2020-12-23 Anna Vershynina

For a prime number p greater than 6000, the Olson's constant for the group Z_p+Z_p is given by Ol(Z_p+Z_p)=p-1+Ol(Z_p).

数论 · 数学 2008-12-18 Gautami Bhowmik , Jan-Christoph Schlage-Puchta

We determine upper bounds for the maximum order of an element of a finite almost simple group with socle T in terms of the minimum index m(T) of a maximal subgroup of T: for T not an alternating group we prove that, with finitely many…

群论 · 数学 2013-01-23 Simon Guest , Joy Morris , Cheryl Praeger , Pablo Spiga

We prove a general upper bound on the $k$-th adjacency eigenvalue of a graph. For $k\ge 2$, we show that \[ \lambda_k(G)\le \frac{(k-2)\sqrt{k+1}+2}{2k(k-1)}\,n-1 \] for every graph $G$ on $n$ vertices. We build on a recent approach that…

组合数学 · 数学 2026-03-31 Varun Sivashankar

Jacobi's results on the computation of the order and of the normal forms of a differential system are translated in the formalism of differential algebra. In the quasi-regular case, we give complete proofs according to Jacobi's arguments.…

历史与综述 · 数学 2023-09-06 François Ollivier

Without assuming the Northcott property we provide an upper bound on the number of "big solutions" of a special system of Diophantine inequalities over proper adelic curves. This system is interesting since it is a stronger version Roth's…

数论 · 数学 2023-08-08 Paolo Dolce

We obtain a new upper bound for $\sum_{h\le H}\Delta_k(N,h)$ for $1\le H\le N$, $k\in \N$, $k\ge3$, where $\Delta_k(N,h)$ is the (expected) error term in the asymptotic formula for $\sum_{N < n\le2N}d_k(n)d_k(n+h)$, and $d_k(n)$ is the…

数论 · 数学 2011-11-29 Aleksandar Ivic , Jie Wu

We prove that if $G$ is an abelian group and $H_1x_1,\dots,H_{k}x_k$ is an irredundant (minimal) cover of $G$ with cosets, then $$|G:\bigcap_{i=1}^{k}H_{i}|=2^{O(k)}.$$ This bound is the best possible up to the constant hidden in the…

组合数学 · 数学 2022-11-01 János Nagy , Péter Pál Pach , István Tomon

We obtain a decidability result for the Davenport constant.

We establish a sharp lower-bound for the number of conjugacy classes $k(A_n)$ in the alternating group $A_n$, for $n \geq 3$. Namely, we show that $k\left(A_n\right) \geq \frac{k\left(A_7\right)}{\log_2\left|A_7\right|} \cdot…

群论 · 数学 2023-10-19 Xandru Mifsud

We consider the problem of upper bounding the number of circular transpositions needed to sort a permutation. It is well known that any permutation can be sorted using at most $n(n-1)/2$ adjacent transpositions. We show that, if we allow…

离散数学 · 计算机科学 2014-02-21 Anke van Zuylen , James Bieron , Frans Schalekamp , Gexin Yu

We give a bound on the number of points of order two on the theta divisor of a principally polarized abelian variety A. When A is the Jacobian of a curve C the result can be applied in estimating the number of effective square roots of a…

代数几何 · 数学 2012-02-08 Valeria Ornella Marcucci , Gian Pietro Pirola

The number of $n$-ary bent functions is less than $2^{3\cdot2^{n-3}(1+o(1))}$ as $n$ is even and $n\rightarrow\infty$. Keywords: Boolean function, bent function, upper bound

信息论 · 计算机科学 2023-03-30 Vladimir N. Potapov

Let A be an abelian variety defined over a number field K and let P and Q be points in A(K) satisfying the following condition: for all but finitely many primes p of K, the order of (Q mod p) divides the order of (P mod p). Larsen proved…

代数几何 · 数学 2011-02-22 Jeroen Demeyer , Antonella Perucca
‹ 上一页 1 8 9 10 下一页 ›