English
Related papers

Related papers: On the minimum modulus problem in number fields

200 papers

A famous unsolved conjecture of P. Erdos and J. L. Selfridge states that there does not exist a covering system {a_s(mod n_s)}_{s=1}^k with the moduli n_1,...,n_k odd, distinct and greater than one. In this paper we show that if such a…

Number Theory · Mathematics 2007-05-23 Song Guo , Zhi-Wei Sun

A variant of the well-known Set Covering Problem is studied in this paper, where subsets of a collection have to be selected, and pairwise conflicts among subsets of items exist. The selection of each subset has a cost, and the inclusion of…

Optimization and Control · Mathematics 2025-04-22 Roberto Montemanni , Derek H. Smith

Quantitative estimates related to the classical Borsuk problem of splitting set in Euclidean space into subsets of smaller diameter are considered. For a given $k$ there is a minimal diameter of subsets at which there exists a covering with…

Metric Geometry · Mathematics 2022-10-25 Alexander Tolmachev , Dmitry Protasov , Vsevolod Voronov

In 1933, K. Borsuk proposed the following problem: Can every bounded set in $\mathbb{E}^n$ be divided into $n+1$ subsets of smaller diameters? In 1965, V. G. Boltyanski and I. T. Gohberg made the following conjecture: Every bounded set in…

Metric Geometry · Mathematics 2022-10-13 Jun Wang , Fei Xue , Chuanming Zong

We propose an optimal low-resolution precoding technique that minimizes the symbol error probability of the users. Unlike existing approaches that rely on QPSK modulation, for the derivation of the minimum symbol error probability objective…

Information Theory · Computer Science 2021-10-07 Erico S. P. Lopes , Lukas T. N. Landau , Amine Mezghani

A family of planar curves is called a Moser family if it contains an isometric copy of every rectifiable curve in $\mathbb{R}^{2}$ of length one. The classical "worm problem" of L. Moser from 1966 asks for the least area covered by the…

Classical Analysis and ODEs · Mathematics 2016-07-26 Katrin Fässler , Tuomas Orponen

It is well known that in an exact covering system in $\mathbb{Z}$, the biggest modulus must be repeated. Very recently, Kim gave an analogous result for certain quadratic fields, and Kim also conjectured that it must hold in any algebraic…

Number Theory · Mathematics 2013-01-21 Yupeng Jiang , Yingpu Deng

Theoretical background is provided towards the mathematical foundation of the minimum enclosing ball problem. This problem concerns the determination of the unique spherical surface of smallest radius enclosing a given bounded set in the…

Computational Geometry · Computer Science 2024-02-13 Michael N. Vrahatis

We consider cosmological scenarios in which density perturbations are generated by the quantum fluctuations of the inflaton field at early times; the late time dynamics involves a modulus which first dominates the energy density of the…

High Energy Physics - Phenomenology · Physics 2015-03-09 Koushik Dutta , Anshuman Maharana

In this paper we study the following problems: given a finite number of nonempty closed subsets of a normed space, find a ball with the smallest radius that encloses all of the sets, and find a ball with the smallest radius that intersects…

Optimization and Control · Mathematics 2012-01-04 Boris S. Mordukhovich , Nguyen Mau Nam , Cristina Villalobos

Codes over permutations under the infinity norm have been recently suggested as a coding scheme for correcting limited-magnitude errors in the rank modulation scheme. Given such a code, we show that a simple relabeling operation, which…

Information Theory · Computer Science 2011-09-20 Itzhak Tamo , Moshe Schwartz

The internal geometry of most modern consumer cameras is not adequately described by the perspective projection. Almost all cameras exhibit some radial lens distortion and are equipped with an electronic rolling shutter that induces…

Computer Vision and Pattern Recognition · Computer Science 2020-04-30 Zuzana Kukelova , Cenek Albl , Akihiro Sugimoto , Konrad Schindler , Tomas Pajdla

The notion of minimal complements was introduced by Nathanson in 2011. Since then, the existence or the inexistence of minimal complements of sets have been extensively studied. Recently, the study of inverse problems, i.e., which sets can…

Combinatorics · Mathematics 2021-08-10 Arindam Biswas , Jyoti Prakash Saha

We establish an explicit upper bound for the Euclidean minimum of a number field which depends, in a precise manner, only on its discriminant and the number of real and complex embeddings. Such bounds were shown to exist by Davenport and…

Number Theory · Mathematics 2023-01-24 Eva Bayer-Fluckiger , Martino Borello , Peter Jossen

Model-based computational elasticity imaging of tissues can be posed as solving an inverse problem over finite elements spanning the displacement image. As most existing quasi-static elastography methods count on deterministic formulations…

Image and Video Processing · Electrical Eng. & Systems 2020-10-22 Narges Mohammadi , Marvin M. Doyley , Mujdat Cetin

We study the simplex method over polyhedra satisfying certain "discrete curvature" lower bounds, which enforce that the boundary always meets vertices at sharp angles. Motivated by linear programs with totally unimodular constraint…

Data Structures and Algorithms · Computer Science 2014-12-23 Daniel Dadush , Nicolai Hähnle

We revisit the source image estimation problem from blind source separation (BSS). We generalize the traditional minimum distortion principle to maximum likelihood estimation with a model for the residual spectrograms. Because residual…

Audio and Speech Processing · Electrical Eng. & Systems 2020-09-14 Robin Scheibler

Distortion (Denneberg 1990) is a well known premium calculation principle for insurance contracts. In this paper, we study sensitivity properties of distortion functionals w.r.t. the assumptions for risk aversion as well as robustness…

Risk Management · Quantitative Finance 2018-09-19 Daniela Escobar , Georg Pflug

We investigate the densities of the sets of abundant numbers and of covering numbers, integers $n$ for which there exists a distinct covering system where every modulus divides $n$. We establish that the set $\mathcal{C}$ of covering…

Number Theory · Mathematics 2026-02-12 Nathan McNew , Jai Setty

We imagine an experiment on an unknown quantum mechanical system in which the system is prepared in various ways and a range of measurements are performed. For each measurement M and preparation rho the experimenter can determine, given…

Quantum Physics · Physics 2009-01-20 Stephanie Wehner , Matthias Christandl , Andrew C. Doherty
‹ Prev 1 3 4 5 6 7 10 Next ›