Related papers: Integer Points in Knapsack Polytopes and s-coverin…

Let $f_1(x),\ldots,f_n(x)$ be some polynomials. The upper bound on the number of $x\in\mathbb F_p$ such that $f_1(x),\ldots,f_n(x)$ are roots of unit of order $t$ is obtained. This bound generalize the bound of the paper \cite{V-S} to the…

Let X be a Noetherian space, let f be a continuous self-map on X, let Y be a closed subset of X, and let x be a point on X. We show that the set S consisting of all nonnegative integers n such that f^n(x) is in Y is a union of at most…

We apply the replica analysis established by Gardner to the multi-constraint continuous knapsack problem,which is one of the linear programming problems and a most fundamental problem in the field of operations research (OR). For a large…

Given a prime $p\ge5$ and an integer $s\ge1$, we show that there exists an integer $M$ such that for any quadratic polynomial $f$ with coefficients in the ring of integers modulo $p^s$, such that $f$ is not a square, if a sequence…

Given a set $V$, a subset $S$, and a permutation $\pi$ of $V$, we say that $\pi$ permutes $S$ if $\pi (S) \cap S = \emptyset$. Given a collection $\cS = \{V; S_1,\ldots , S_m\}$, where $S_i \subseteq V ~~(i=1,\ldots ,m)$, we say that $\cS$…

We introduce the notion of approximate numerical radius (Birkhoff) orthogonality and investigate its significant properties. Let $T, S\in \mathbb{B}(\mathscr{H})$ and $\varepsilon \in [0, 1)$. We say that $T$ is approximate numerical radius…

For scientific computations on a digital computer the set of real number is usually approximated by a finite set F of "floating-point" numbers. We compare the numerical accuracy possible with difference choices of F having approximately the…

A compact circle-packing $P$ of the Euclidean plane is a set of circles which bound mutually disjoint open discs with the property that, for every circle $S\in P$, there exists a maximal indexed set $\{A_{0},\ldots,A_{n-1}\}\subseteq P$ so…

Given a polygon $P$, for two points $s$ and $t$ contained in the polygon, their \emph{geodesic distance} is the length of the shortest $st$-path within $P$. A \emph{geodesic disk} of radius $r$ centered at a point $v \in P$ is the set of…

For a finite set of integers such that the first few gaps between its consecutive elements equal $a$, while the remaining gaps equal $b$, we study dense packings of its translates on the line. We obtain an explicit lower bound on the…

Let $H$ be a Hilbert space and $H_1,...,H_n$ be closed subspaces of $H$. Denote by $P_k$ the orthogonal projection onto $H_k$, $k=1,2,...,n$. Following Patrick L. Combettes and Noli N. Reyes, we will say that the system of subspaces…

We consider set covering problems where the underlying set system satisfies a particular replacement property w.r.t. a given partial order on the elements: Whenever a set is in the set system then a set stemming from it via the replacement…

We show that, for a positive integer $r$, every minimal 1-saturating set in ${\rm PG}(r-1,2)$ of size at least ${11/36} 2^r+3$ is either a complete cap or can be obtained from a complete cap $S$ by fixing some $s\in S$ and replacing every…

We propose integer-programming formulations for an optimal safety-landing site (SLS) location problem that arises in the design of urban air-transportation networks. We first develop a set-cover based approach for the case where the…

Let $\mathbf{K}$ be a field and $\phi$, $\mathbf{f} = (f_1, \ldots, f_s)$ in $\mathbf{K}[x_1, \dots, x_n]$ be multivariate polynomials (with $s < n$) invariant under the action of $\mathcal{S}_n$, the group of permutations of $\{1, \dots,…

The normal covering number $\gamma(G)$ of a finite group $G$ is the minimum number of proper subgroups whose conjugates cover the group. We give various estimates for $\gamma(S_n)$ and $\gamma(A_n)$ depending on the arithmetic structure of…

We study the geometric knapsack problem in which we are given a set of $d$-dimensional objects (each with associated profits) and the goal is to find the maximum profit subset that can be packed non-overlappingly into a given…

We consider a closed set S in R^n and a linear operator \Phi on the polynomial algebra R[X_1,...,X_n] that preserves nonnegative polynomials, in the following sense: if f\geq 0 on S, then \Phi(f)\geq 0 on S as well. We show that each such…

This paper is mainly concerned with the disk of convergence of a power series s(x) representing an algebraic function of x and specifically with the relation between this disk and the branch points of the function. We shall focus especially…

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…