Related papers: Expected Frobenius numbers
For each pair of matrices $A$ and $B$ with the same order, let $\|A-B\|_F$ denote their Frobenius distance. This paper deals mainly with the Frobenius distances from projections to an idempotent matrix. For every idempotent $Q\in…
We improve certain degree bounds for Grobner bases of polynomial ideals in generic position. We work exclusively in deterministically verifiable and achievable generic positions of a combinatorial nature, namely either strongly stable…
We present a sharp upper bound for the number of generators of a finite group in terms of the ratio between the order and the exponent.
We prove convex ordering results for random vectors admitting a predictable representation in terms of a Brownian motion and a non-necessarily independent jump component. Our method uses forward-backward stochastic calculus and extends…
We study the Frobenius problem: given relatively prime positive integers $a_1,...,a_d$, find the largest value of t (the Frobenius number) such that $\sum_{k=1}^d m_k a_k = t$ has no solution in nonnegative integers $m_1,...,m_d$. Based on…
We compute the Frobenius number for numerical semigroups generated by the squares of three consecutive Fibonacci numbers. We achieve this by using and comparing three distinct algorithmic approaches: those developed by Ram\'irez Alfons\'in…
In this paper we investigate the Erd\"os/Falconer distance conjecture for a natural class of sets statistically, though not necessarily arithmetically, similar to a lattice. We prove a good upper bound for spherical means that have been…
The computation of the order of Frobenius action on the $\ell$-torsion is a part of Schoof-Elkies-Atkin algorithm for point counting on an elliptic curve $E$ over a finite field $\mathbb{F}_q$. The idea of Schoof's algorithm is to compute…
In this paper we obtain new lower bounds for the upper box dimension of $\alpha\beta$ sets. As a corollary of our main result, we show that if $\alpha$ is not a Liouville number and $\beta$ is a Liouville number, then the upper box…
We determine the probability, structure dependent, that the block Wiedemann algorithm correctly computes leading invariant factors. This leads to a tight lower bound for the probability, structure independent. We show, using block size…
In this paper we give an asymptotically tight bound for the tolerated Tverberg Theorem when the dimension and the size of the partition are fixed. To achieve this we study certain partitions of order-type homogeneous sets and use a…
We introduce the notion of the \textit{principal element} of a Frobenius Lie algebra $\f$. The principal element corresponds to a choice of $F\in \f^*$ such that $F[-,-]$ non-degenerate. In many natural instances, the principal element is…
We consider the question as to whether the exponent of a computably presentable Lebesgue space whose dimension is at least 2 must be computable. We show this very natural conjecture is true when the exponent is at least 2 or when the space…
We prove a new lower bound for the Mahler measure of a polynomial in one and in several variables that depends on the complex coefficients, and the number of monomials. In one variable our result generalizes a classical inequality of…
An estimate of the order of approximation in the central limit theorem for strictly stationary associated random variables with finite moments of order q > 2 is obtained. A moderate deviation result is also obtained. We have a refinement of…
We prove a uniform estimate of the number of points for difference algebraic varieties in finite difference fields in the spirit of Lang-Weil. More precisely, we give uniform lower and upper bounds for the number of rational points of a…
Given relative prime positive integers $A=(a_1, a_2, ..., a_n)$, the Frobenius number $g(A)$ is the largest integer not representable as a linear combination of the $a_i$'s with nonnegative integer coefficients. We find the ``Stable"…
The purpose of this note is to provide a reference for the fact that the strong Frobenius number, in the sense of Eaton and Livesey, of a block of a finite group with a cyclic defect group is equal to one. This answers a question of Farrell…
The Hausdorff dimension of the set of points that are covered infinitely many times by a sequence of randomly distributed balls in the unit cube can be expressed in terms of the sizes of the balls. This note presents a new proof of the…
The classical Frobenius problem is to compute the largest number g not representable as a non-negative integer linear combination of non-negative integers x_1, x_2, ..., x_k, where gcd(x_1, x_2, ..., x_k) = 1. In this paper we consider…