Related papers: On the minimum modulus problem in number fields
We study the replacement paths problem in the $\mathsf{CONGEST}$ model of distributed computing. Given an $s$-$t$ shortest path $P$, the goal is to compute, for every edge $e$ in $P$, the shortest-path distance from $s$ to $t$ avoiding $e$.…
Numerical invariants of a minimal free resolution of a module $M$ over a regular local ring $(R,\n)$ can be studied by taking advantage of the rich literature on the graded case. The key is to fix suitable $\n$-stable filtrations ${\mathbb…
Given a $K$-vector space $V$, let $\sigma(V,K)$ denote the covering number, i.e. the smallest (cardinal) number of proper subspaces whose union covers $V$. Analogously, define $\sigma(M,R)$ for a module $M$ over a unital commutative ring…
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy set cover problem previously studied by Halperin and Karp…
We consider the problem of minimizing a polynomial function over the integer lattice. Though impossible in general, we use a known sufficient condition for the existence of continuous minimizers to guarantee the existence of integer…
We state an open problem in the theory of diversities: what is the worst case minimal distortion embedding of a diversity on $n$ points in $\ell_1$. This problem is the diversity analogue of a famous problem in metric geometry: what is the…
A numerical method based on the hybridizable discontinuous Galerkin method in space and backward Euler in time is formulated and analyzed for solving the miscible displacement problem. Under low regularity assumptions, convergence is…
In this paper, we investigate a class of submodular problems which in general are very hard. These include minimizing a submodular cost function under combinatorial constraints, which include cuts, matchings, paths, etc., optimizing a…
For fixed $m$ and $R\subseteq \{0,1,\ldots,m-1\}$, take $A$ to be the set of positive integers congruent modulo $m$ to one of the elements of $R$, and let $p_A(n)$ be the number of ways to write $n$ as a sum of elements of $A$. Nathanson…
We give bounds for the number and the size of the primes $p$ such that a reduction modulo $p$ of a system of multivariate polynomials over the integers with a finite number $T$ of complex zeros, does not have exactly $T$ zeros over the…
We revisit the problem of solving the one-dimensional wave equation on a domain with moving boundary. In J. Math. Phys. 11, 2679 (1970), Moore introduced an interesting method to do so. As only in rare cases, a closed analytical solution is…
Caire, Taricco and Biglieri presented a detailed analysis of bit interleaved coded modulation, a simple and popular technique used to improve system performance, especially in the context of fading channels. They derived an upper bound to…
Minimal models of a Boolean formula play a pivotal role in various reasoning tasks. While previous research has primarily focused on qualitative analysis over minimal models; our study concentrates on the quantitative aspect, specifically…
In this paper, we will present a generalization for a minimization problem from I. Daubechies, M. Defrise, and C. Demol [3]. This generalization is useful for solving many practical problems in which more than one constraint are involved.…
We investigate a variety of problems of finding tours and cycle covers with minimum turn cost. Questions of this type have been studied in the past, with complexity and approximation results as well as open problems dating back to work by…
The minus partial order is already known for sets of matrices over a field and bounded linear operators on arbitrary Hilbert spaces. Recently, this partial order has been studied on Rickart rings. In this paper, we extend the concept of the…
We study the problem of computing the exterior modulus of a bounded quadrilateral. We reduce this problem to the numerical solution of the Dirichlet-Neumann problem for the Laplace equation. Several experimental results, with error…
We study the $k$-resultant modulus set problem in the $d$-dimensional vector space $\mathbb F_q^d$ over the finite field $\mathbb F_q$ with $q$ elements. Given $E\subset \mathbb F_q^d$ and an integer $k\ge 2$, the $k$-resultant modulus set,…
We study the Minimum Sum Vertex Cover problem, which asks for an ordering of vertices in a graph that minimizes the total cover time of edges. In particular, n vertices of the graph are visited according to an ordering, and for each edge…
We consider a class of stable smoothable n-dimensional varieties, the analogs of stable curves. Assuming the minimal model program in dimension n+1, we prove that this class is bounded. From Kollar's method of constructing projective moduli…