Related papers: On Feasibility of Integer Knapsacks
Maximal lattice free bodies are maximal polytopes without interior integral points. Scarf initiated the study of maximal lattice free bodies relative to the facet normals in a fixed matrix. In this paper we give an efficient algorithm for…
We study the non-linear extension of integer programming with greatest common divisor constraints of the form $\gcd(f,g) \sim d$, where $f$ and $g$ are linear polynomials, $d$ is a positive integer, and $\sim$ is a relation among $\leq, =,…
For a real set $A$ consider the semigroup $S(A)$, additively generated by $A$; that is, the set of all real numbers representable as a (finite) sum of elements of $A$. If $A \subset (0,1)$ is open and non-empty, then $S(A)$ is easily seen…
Frobenius companion matrices arise when we write an $n$-th order linear ordinary differential equation as a system of first order differential equations. These matrices and their transpose have very nice properties. By using the powers of…
Given an integral $d \times n$ matrix $A$, the well-studied affine semigroup $\mbox{ Sg} (A)=\{ b : Ax=b, \ x \in {\mathbb Z}^n, x \geq 0\}$ can be stratified by the number of lattice points inside the parametric polyhedra $P_A(b)=\{x:…
The Frobenius of a matrix $M$ with coefficients in $\bar{\mathbb F}_p$ is the matrix $\sigma(M)$ obtained by raising each coefficient to the $p$-th power. We consider the question of counting matrices with coefficients in $\mathbb F_q$…
We study how certain invariants of numerical semigroups relate to the number of second kind gaps. Furthermore, given two fixed non-negative integers F and k, we provide an algorithm to compute all the numerical semigroups whose Frobenius…
Let $R$ be a commutative chain ring. We use a variation of Gr\"obner bases to study the lattice of ideals of $R[x]$. Let $I$ be a proper ideal of $R[x]$. We are interested in the following two questions: When is $R[x]/I$ Frobenius? When is…
In this paper, we investigate the parametric knapsack problem, in which the item profits are affine functions depending on a real-valued parameter. The aim is to provide a solution for all values of the parameter. It is well-known that any…
We examine how sparse feasible solutions of integer programs are, on average. Average case here means that we fix the constraint matrix and vary the right-hand side vectors. For a problem in standard form with m equations, there exist LP…
We study the problem of maximizing a monotone submodular function subject to a Multiple Knapsack constraint. The input is a set $I$ of items, each has a non-negative weight, and a set of bins of arbitrary capacities. Also, we are given a…
We show for each positive integer $a$ that, if $\cM$ is a minor-closed class of matroids not containing all rank-$(a+1)$ uniform matroids, then there exists an integer $n$ such that either every rank-$r$ matroid in $\cM$ can be covered by…
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…
Recently knapsack problems have been generalized from the integers to arbitrary finitely generated groups. The knapsack problem for a finitely generated group $G$ is the following decision problem: given a tuple $(g, g_1, \ldots, g_k)$ of…
Let $A$ be an abelian variety over $\mathbb{Q}$ of dimension $g$ such that the image of its associated absolute Galois representation $\rho_A$ is open in $\operatorname{GSp}_{2g}(\hat{\mathbb{Z}})$. We investigate the arithmetic of the…
In the Frobenius problem we are given a set of coprime, positive integers $a_1, a_2,...,a_k$, and are interested in the set of positive numbers NR that have no representation by the linear form $\sum_i a_ix_i$ in nonnegative integers $x_1,…
The success of randomized range finders (RRFs) is typically analyzed via the singular value gaps of a target matrix $A$. In this work, we show that the so-called Frobenius singular value ratio provides a sharper analysis of an RRF's…
We consider the problem of efficient integration of an n-variate polynomial with respect to the Gaussian measure in R^n and related problems of complex integration and optimization of a polynomial on the unit sphere. We identify a class of…
The study of Frobenius endomorphism provides numerous information about its corresponding Abelian variety. To understand the action of the Frobenius endomorphism, one may be interested in its eigenvalues. According to Weil's third…
We consider the problem of finding embeddings of arc-like continua in the plane for which each point in a given subset is accessible. We establish that, under certain conditions on an inverse system of arcs, there exists a plane embedding…