English
Related papers

Related papers: Bounds for discrete tomography solutions

200 papers

For a hyperbolic 3-manifold $M$ with a torus boundary component,all but finitely many Dehn fillings yield hyperbolic 3-manifolds. In this paper, we will focus on the situation where $M$ has two exceptional Dehn fillings: an annular filling…

Geometric Topology · Mathematics 2007-05-23 Sangyop Lee , Masakazu Teragaito

We study the problem of finding a triangulation T of a planar point set S such as to minimize the expected distance between two points x and y chosen uniformly at random from S. By distance we mean the length of the shortest path between x…

Computational Geometry · Computer Science 2012-06-21 Laszlo Kozma

We establish a framework to construct a global solution in the space of finite energy to a general form of the Landau-Lifshitz-Gilbert equation in $\mathbb{R}^2$. Our characterization yields a partially regular solution, smooth away from a…

Analysis of PDEs · Mathematics 2009-11-10 Joy Ko

New lower bounds on the minimum average Hamming distance of binary codes are derived. The bounds are obtained using linear programming approach.

Information Theory · Computer Science 2007-07-13 Beniamin Mounits

We describe the boundary of linear subvarieties in the moduli space of multi-scale differentials. Linear subvarieties are algebraic subvarieties of strata of (possibly) meromorphic differentials that in local period coordinates are given by…

Algebraic Geometry · Mathematics 2023-01-11 Frederik Benirschke

We provide an algorithm of constructing a rectifiable curve between two sufficiently close points of a proximally smooth set in a uniformly convex and uniformly smooth Banach space. Our algorithm returns a reasonably short curve between two…

Functional Analysis · Mathematics 2020-12-22 Grigory Ivanov , Mariana Lopushanski

We introduce a notion of distance between supervised learning problems, which we call the Risk distance. This distance, inspired by optimal transport, facilitates stability results; one can quantify how seriously issues like sampling bias,…

Machine Learning · Computer Science 2025-09-12 Facundo Mémoli , Brantley Vose , Robert C. Williamson

To approximate solutions of a linear differential equation, we project, via trigonometric interpolation, its solution space onto a finite-dimensional space of trigonometric polynomials and construct a matrix representation of the…

Numerical Analysis · Mathematics 2011-08-30 Oksana Bihun , Austin Bren , Michael Dyrud , Kristin Heysse

We study the fully discrete elliptic integrable model Q4 and its immediate trigonometric and rational counterparts (Q3, Q2 and Q1). Singular boundary problems for these equations are systematised in the framework of global singularity…

Exactly Solvable and Integrable Systems · Physics 2011-08-24 James Atkinson , Nalini Joshi

We analyze integer linear programs which we obtain after discretizing two-dimensional subproblems arising from a trust-region algorithm for mixed integer optimal control problems with total variation regularization. We discuss NP-hardness…

Optimization and Control · Mathematics 2025-03-07 Paul Manns , Marvin Severitt

We consider the problem of minimizing a sum of non-convex functions over a compact domain, subject to linear inequality and equality constraints. Approximate solutions can be found by solving a convexified version of the problem, in which…

Optimization and Control · Mathematics 2016-01-12 Madeleine Udell , Stephen Boyd

A stationary random sequence admits under some assumptions a representation as the sum of two others: one of them is a martingale difference sequence, and another is a so-called coboundary. Such a representation can be used for proving some…

Probability · Mathematics 2008-12-24 Mikhail Gordin

Let $Z \subseteq \proj{n}$ be a fat points scheme, and let $d(Z)$ be the minimum distance of the linear code constructed from $Z$. We show that $d(Z)$ imposes constraints (i.e., upper bounds) on some specific shifts in the graded minimal…

Commutative Algebra · Mathematics 2012-04-02 Stefan O. Tohaneanu , Adam Van Tuyl

We study the problem of representing a discrete tensor that comes from finite uniform samplings of a multi-dimensional and multiband analog signal. Particularly, we consider two typical cases in which the shape of the subbands is cubic or…

Signal Processing · Electrical Eng. & Systems 2024-05-21 Yuhan Li , Tianyao Huang , Yimin Liu , Xiqin Wang

In this paper we give a description of separating or disjointness preserving linear bijections on spaces of vector-valued absolutely continuous functions defined on compact subsets of the real line. We obtain that they are continuous and…

Functional Analysis · Mathematics 2009-06-10 Luis Dubarbie

The issue of single-grid discretization error estimator, operating in the postprocessor mode, is addressed in the paper. An ensemble of numerical solutions, obtained using solvers of different accuracy, is shown to provide an upper estimate…

Computational Physics · Physics 2018-05-11 A. K. Alekseev , A. E. Bondarev , I. M. Navon

This paper develops a mathematical theory of super-resolution. Broadly speaking, super-resolution is the problem of recovering the fine details of an object---the high end of its spectrum---from coarse scale information only---from samples…

Information Theory · Computer Science 2012-11-15 Emmanuel Candes , Carlos Fernandez-Granda

The goal of this paper is to clarify when the solutions to stochastic partial differential equations stay close to a given subset of the state space for starting points which are close as well. This includes results for deterministic…

Probability · Mathematics 2024-10-10 Toshiyuki Nakayama , Stefan Tappe

We explore singular second-order boundary value problems with mixed boundary conditions on a general time scale. Using the lower and upper solutions method combined with the Brouwer fixed point theorem we demonstrate the existence of a…

Analysis of PDEs · Mathematics 2025-06-23 Shalmali Bandyopadhyay , Curtis J Kunkel

For nonnegative integers $n_2, n_3$ and $d$, let $N(n_2,n_3,d)$ denote the maximum cardinality of a code of length $n_2+n_3$, with $n_2$ binary coordinates and $n_3$ ternary coordinates (in this order) and with minimum distance at least…

Combinatorics · Mathematics 2018-04-03 Bart Litjens