相关论文: Generalized Frobenius numbers: Bounds and average …

We present a method to obtain upper bounds on covering numbers. As applications of this method, we reprove and generalize results of Rogers on economically covering Euclidean $n$-space with translates of a convex body, or more generally,…

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…

Let $N \geq2$ and let $1 < a_1 < ... < a_N$ be relatively prime integers. Frobenius number of this $N$-tuple is defined to be the largest positive integer that cannot be expressed as $\sum_{i=1}^N a_i x_i$ where $x_1,...,x_N$ are…

We define the Frobenius limit of a module over a ring of prime characteristic to be the limit of the normalized Frobenius direct images in a certain Grothendieck group. When a finite group acts on a polynomial ring, we calculate this limit…

We apply polynomial techniques (linear programming) to obtain lower and upper bounds on the covering radius of spherical designs as function of their dimension, strength, and cardinality. In terms of inner products we improve the lower…

The theory of Frobenius groups with Frobenius complements of even order largely reduces to tractable algebraic number theory. If we consider only Frobenius complements with an upper bound $s$ on the number of distinct primes dividing the…

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…

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…

We prove a new lower bound for the Frobenius norm of the inverse of an non-negative matrix. This bound is only a modest improvement over previous results, but is sufficient for fully resolving a conjecture of Harwitz and Sloane, commonly…

In [14] we found the large genus asymptotics of Hurwitz numbers for the Riemann sphere with a fixed number of general profiles and some (2,1^{d-2}) profiles. In this paper, motivated from [3], we generalize these results to Hurwitz numbers…

We show that for large instances the order of magnitude of the expected Frobenius number is (up to a constant depending only on the dimension) given by its lower bound.

We prove bounds for the covering numbers of classes of convex functions and convex sets in Euclidean space. Previous results require the underlying convex functions or sets to be uniformly bounded. We relax this assumption and replace it…

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…

We derive upper and lower bounds on the sum of distances of a spherical code of size $N$ in $n$ dimensions when $N\sim n^\alpha, 0<\alpha\le 2.$ The bounds are derived by specializing recent general, universal bounds on energy of spherical…

We use geometric and cohomological methods to show that given a degree bound for membership in ideals of a fixed degree type in the polynomial ring P=k[x_0,..., x_d], one obtains a good generic degree bound for membership in the tight…

A central problem in discrete geometry, known as Hadwiger's covering problem, asks what the smallest natural number $N\left(n\right)$ is such that every convex body in ${\mathbb R}^{n}$ can be covered by a union of the interiors of at most…

We prove a generalized version of Kazhdan's theorem for canonical forms on Riemann surfaces. In the classical version, one starts with an ascending sequence $\{S_n \rightarrow S\}$ of finite Galois covers of a hyperbolic Riemann Surface…

In this paper we study the (classical) Frobenius problem, namely the problem of finding the largest integer that cannot be represented as a nonnegative integral combination of given relatively prime (strictly) positive integers (known as…

With suitable order of limits, as p, m, and n all tend to infinity, the distribution of the normalized trace of Frobenius on H^1 of a "random" plane curve of degree n over the field with p^m elements, tends to a Gaussian distribution. The…

Coding Theory where the alphabet is identified with the elements of a ring or a module has become an important research topic over the last 30 years. Such codes over rings had important applications and many interesting mathematical…