Iskander Aliev, Peter Gruber
Given $N$ positive integers $a_1, ..., a_N$ with $\gcd(a_1, ..., a_N)=1$, let $f_N$ denote the largest natural number which is not a positive integer combination of $a_1, ..., a_N$. This paper gives an optimal lower bound for $f_N$ in terms of the absolute inhomogeneous minimum of the standard $(N-1)$-simplex.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We consider the expected value of $\mbox{Tr}(Θ_C^n)$ where $C$ runs over a thin family of $r$-cyclic covers of $\mathbb{P}^1_{\mathbb{F}_q}$ for any $r$. We obtain many lower order terms dependent on the divisors of $r$. We use these results to calculate the one-level density of the family and hypothesize a refined one-level density result.
We give upper and lower bounds for the largest integer not representable as positive linear combination of three given integers, disproving an upper bound conjectured by Beck, Einstein and Zacks.
Counting Frobenius Pseudoprimes
本研究将Frobenius伪素数计数从一、二次情形推广到任意次数，给出Grantham Frobenius素性检验的伪证数计数公式，以及Frobenius伪素数平均数量的条件渐近上下界。
In this paper we obtain lower and upper bounds on the average number of liars for the Quadratic Frobenius Pseudoprime Test of Grantham, generalizing arguments of Erdős and Pomerance, and Monier. These bounds are provided for both Jacobi symbol plus and minus cases, providing evidence for the existence of several challenge pseudoprimes.
We obtain sharp upper and lower bounds on a certain four-dimensional Frobenius number determined by a prime pair $(p,q)$, $2<p<q$, including exact formulae for two infinite subclasses of such pairs. Our work is motivated by the study of compact Riemann surfaces which can be realized as a semi-regular $pq$-fold coverings of surfaces of lower genus. In this context, the Frobenius number is (up to an additive translation) the largest genus in which no surface is such a covering. In many cases it is also the largest genus in which no surface admits an automorphism of order $pq$. The general $t$-di…
Consider a meromorphic connection on P^1 over a p-adic field. In many cases, such as those arising from Picard-Fuchs equations or Gauss-Manin connections, this connection admits a Frobenius structure defined over a suitable rigid analytic subspace. We give an effective convergence bound for this Frobenius structure by studying the effect of changing the Frobenius lift. We also give some examples indicating that our bound is essentially optimal.
We produce new upper and lower bounds for the s-Frobenius number by relating it to the so called s-covering radius of a certain convex body with respect to a certain lattice; this generalizes a well-known theorem of R. Kannan for the classical Frobenius number. Using these bounds, we obtain results on the average behavior of the s-Frobenius number, extending analogous recent investigations for the classical Frobenius number by a variety of authors. We also derive bounds on the s-covering radius, an interesting geometric quantity in its own right.
Hodge and Frobenius colevels of algebraic varieties
本文为代数簇的Hodge与Frobenius余级在所有上同调维度上提供了以维数和定义方程多重次数表示的新下界，从而增强了Esnault与第一作者所提问题的肯定回答。
Frobenius problem and its many generalizations have been extensively studied in several areas of mathematics. We study semigroups of totally positive algebraic integers in totally real number fields, defining analogues of the Frobenius numbers in this context. We use a geometric framework recently introduced by Aliev, De Loera and Louveaux to produce upper bounds on these Frobenius numbers in terms of a certain height function. We discuss some properties of this function, relating it to absolute Weil height and obtaining a lower bound in the spirit of Lehmer's conjecture for algebraic vectors …
The Frobenius number $g(S)$ of a set $S$ of non-negative integers with $\gcd 1$ is the largest integer not expressible as a linear combination of elements of $S$. Given a sequence ${\bf s} = (s_i)_{i \geq 0}$, we can define the associated sequence $G_{\bf s} (i) = g(\{ s_i,s_{i+1},\ldots \})$. In this paper we compute $G_{\bf s} (i)$ for some classical automatic sequences: the evil numbers, the odious numbers, and the lower and upper Wythoff sequences. In contrast with the usual methods, our proofs are based largely on automata theory and logic.
Let $N \geq 2$ and let $1 < a_1 < ... < a_N$ be relatively prime integers. The Frobenius number of this $N$-tuple is defined to be the largest positive integer that has no representation as $\sum_{i=1}^N a_i x_i$ where $x_1,...,x_N$ are non-negative integers. More generally, the $s$-Frobenius number is defined to be the largest positive integer that has precisely $s$ distinct representations like this. We use techniques from the Geometry of Numbers to give upper and lower bounds on the $s$-Frobenius number for any nonnegative integer $s$.
Revisiting Dwork cohomology: Visibility and divisibility of Frobenius eigenvalues in rigid cohomology
该研究通过Dwork方法探究有限域上代数簇紧支集刚性上同调的Frobenius特征值，得到两个算术推论：仿射簇zeta函数可见证相关特征值，且刚性上同调的q-可除性下界优于ℓ进上同调的已知结果。
Let $S\neq\mathbb N$ be a numerical semigroup with Frobenius number $f$, genus $g$ and embedding dimension $e$. In 1978 Wilf asked the question, whether $\frac{f+1-g}{f+1}\geq\frac1e$. As is well known, this holds in the cases $e=2$ and $e=3$. From Zhai's results in [5] we derive \[\frac{f+1-g}{f+1}\geq\frac2{e^2-e+2}\text{ for }e\geq4\,.\]
We develop a new approach to the computation of the Hausdorff dimension of the invariant set of an iterated function system or IFS. In the one dimensional case, our methods require only C^3 regularity of the maps in the IFS. The key idea, which has been known in varying degrees of generality for many years, is to associate to the IFS a parametrized family of positive, linear, Perron-Frobenius operators L_s. The operators L_s can typically be studied in many different Banach spaces. Here, unlike most of the literature, we study L_s in a Banach space of real-valued, C^k functions, k >= 2; and we…
Distribution of Frobenius elements in families of Galois extensions
该研究通过伽罗瓦群表示与分歧理论不变量刻画伽罗瓦扩张族中Frobenius元素的精细分布，改进了GRH下Chebotarev密度定理误差项的波动上界，推广了相关经典结果并解决了公开问题。
We develop a new approach to the computation of the Hausdorff dimension of the invariant set of an iterated function system or IFS. In the one dimensional case that we consider here, our methods require only $C^3$ regularity of the maps in the IFS. The key idea, which has been known in varying degrees of generality for many years, is to associate to the IFS a parametrized family of positive, linear, Perron-Frobenius operators $L_s$. The operators $L_s$ can typically be studied in many different Banach spaces. Here, unlike most of the literature, we study $L_s$ in a Banach space of real-valued,…
Given an integer mxn matrix A satisfying certain regularity assumptions, we consider the set F(A) of all integer vectors b such that the associated knapsack polytope P(A,b)={x: Ax=b, x>=0} contains an integer point. When m=1 the set F(A) is known to contain all consecutive integers greater than the Frobenius number associated with A. In this paper we introduce the diagonal Frobenius number g(A) which reflects in an analogous way feasibility properties of the problem and the structure of F(A) in the general case. We give an optimal upper bound for g(A) and also estimate the asymptotic growth of…
Let $S$ be a numerical semigroup with Frobenius number $f$, genus $g$ and embedding dimension $e$. % In 1978 Wilf asked the question, whether $\frac{f+1-g}{f+1}\geq\frac1e$. As is well known, this holds in the cases $e=2$ and $e=3$. For $e\geq4$, we derive from results of Zhai [5] the following (substantially weaker) lower bound \[\frac{f+1-g}{f+1}>\left(\frac{2N+1}{(2N+2)(e-2)}\right)^e\text{ with }\lfloor N\rfloor=104978\,.\] To the best of our knowledge this is the first explicit lower bound for $\frac{f+1-g}{f+1}$ in terms of the embedding dimension.
We extend to the general codimension a lower bound for the essential minimum on abelian varieties found in a previous work, under a conjecture about ordinary primes in abelian varieties. This lower bound is the best expected, ``up to an epsilon'', in the degree of the subvariety. Following a strategy of Amoroso, we change the transcendance phasis in order to simplify the zero lemma and its combinatorics. The last argument is a descent procedure on varieties, which is far more intricate in the abelian setting since there is not, in general, a lifting of the Frobenius in characteristic zero.
For a given genus $g \geq 1$, we give lower bounds for the maximal number of rational points on a smooth projective absolutely irreducible curve of genus $g$ over ${\mathbb F}_q$. As a consequence of Katz-Sarnak theory, we first get for any given $g>0$, any $\varepsilon>0$ and all $q$ large enough, the existence of a curve of genus $g$ over ${\mathbb F}_q$ with at least $1+q+ (2g-\varepsilon) \sqrt{q}$ rational points. Then using sums of powers of traces of Frobenius of hyperelliptic curves, we get a lower bound of the form $1+q+1.71 \sqrt{q}$ valid for $g \geq 3$ and odd $q \geq 11$. Finally,…
Given an integer matrix A satisfying certain regularity assumptions, we consider for a positive integer s the set F_s(A) of all integer vectors b such that the associated knapsack polytope P(A,b)={x: Ax=b, x non-negative} contains at least s integer points. In this paper we investigate the structure of the set F_s(A) sing the concept of s-covering radius. In particular, in a special case we prove an optimal lower bound for the s-Frobenius number.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。