English
Related papers

Related papers: Debreu's open gap lemma for semiorders

200 papers

Given a semialgebraic set-valued map $F \colon \mathbb{R}^n \rightrightarrows \mathbb{R}^m$ with closed graph, we show that the map $F$ is Holder metrically subregular and that the following conditions are equivalent: (i) $F$ is an open map…

Optimization and Control · Mathematics 2020-04-15 Jae Hyoung Lee , Tien-Son Pham

Consider the set of probability measures with given marginal distributions on the product of two complete, separable metric spaces, seen as a correspondence when the marginal distributions vary. In problems of optimal transport, continuity…

Risk Management · Quantitative Finance 2020-09-29 Mario Ghossoub , David Saunders

Let \sigma(n) = \sum_{d \mid n}d be the usual sum-of-divisors function. In 1933, Davenport showed that that n/\sigma(n) possesses a continuous distribution function. In other words, the limit D(u):= \lim_{x\to\infty} \frac{1}{x}\sum_{n \leq…

Number Theory · Mathematics 2019-02-20 Emily Jennings , Paul Pollack , Lola Thompson

Whitney's extension problem, i.e., how one can tell whether a function $f : X \to \mathbb R$, $X \subseteq \mathbb R^n$, is the restriction of a $C^m$-function on $\mathbb R^n$, was solved in full generality by Charles Fefferman in 2006. In…

Logic · Mathematics 2025-07-02 Adam Parusiński , Armin Rainer

We consider a length functional for $C^1$ curves of fixed degree in graded manifolds equipped with a Riemannian metric. The first variation of this length functional can be computed only if the curve can be deformed in a suitable sense, and…

Metric Geometry · Mathematics 2021-10-14 Giovanna Citti , Gianmarco Giovannardi , Manuel Ritoré

A famous result by Jeavons, Cohen, and Gyssens shows that every constraint satisfaction problem (CSP) where the constraints are preserved by a semi-lattice operation can be solved in polynomial time. This is one of the basic facts for the…

Computational Complexity · Computer Science 2011-11-30 Manuel Bodirsky , Dugald Macpherson , Johan Thapper

A 1971 conjecture of Graham (later repeated by Erd\H{o}s and Graham) asserts that every set $A \subseteq \mathbb{F}_p \setminus \{0\}$ has an ordering whose partial sums are all distinct. We prove this conjecture for sets of size $|A|…

Combinatorics · Mathematics 2025-01-09 Benjamin Bedert , Noah Kravitz

A set $S\subseteq \re^n$ is called to be {\it Semidefinite (SDP)} representable if $S$ equals the projection of a set in higher dimensional space which is describable by some Linear Matrix Inequality (LMI). The contributions of this paper…

Optimization and Control · Mathematics 2008-12-08 J. William Helton , Jiawang Nie

We introduce a new geometric-analytic functional that we analyse in the context of free discontinuity problems. Its main feature is that the geometric term (the length of the jump set) appears with negative sign. This is motivated by…

Analysis of PDEs · Mathematics 2023-08-02 Dorin Bucur , Alessandro Giacomini , Mickaël Nahon

In arXiv:2212.14023 a decomposition of Gaussian measures on finite-dimensional spaces was introduced, which turned out to be a central technical tool to improve currently known bounds on a long standing conjecture in statistical mechanics…

Probability · Mathematics 2024-02-26 Tobias Schmidt

In this paper we give a conditional improvement to the Elekes-Szab\'{o} problem over the rationals, assuming the Uniformity Conjecture. Our main result states that for $F\in \mathbb{Q}[x,y,z]$ belonging to a particular family of…

Combinatorics · Mathematics 2020-10-20 Mehdi Makhul , Oliver Roche-Newton , Sophie Stevens , Audie Warren

For a $p$-adic differential equation solvable in an open disc (in a $p$-adic sense), around 1970, Dwork proves that the solutions satisfy a certain growth condition on the boundary. Dwork also conjectures that a similar phenomenon should be…

Number Theory · Mathematics 2018-09-12 Shun Ohkubo

In graph theory, the Szemer\'edi regularity lemma gives a decomposition of the indicator function for any graph $G$ into a structured component, a uniform part, and a small error. This result, in conjunction with a counting lemma that…

Combinatorics · Mathematics 2018-11-22 Sammy Luo

The algebraic approach to the Constraint Satisfaction Problem (CSP) uses high order symmetries of relational structures -- polymorphisms -- to study the complexity of the CSP. In this paper we further develop one of the methods the…

Logic in Computer Science · Computer Science 2020-07-21 Andrei A. Bulatov

Gowers norms have been studied extensively both in the direct sense, starting with a function and understanding the associated norm, and in the inverse sense, starting with the norm and deducing properties of the function. Instead of…

Combinatorics · Mathematics 2015-03-17 Bernard Host , Bryna Kra

For a pseudodifferential boundary operator A of integer order \nu and class zero (in the Boutet de Monvel calculus) on a compact n-dimensional manifold with boundary, we consider the function Trace(AB^{-s}) where B is an auxiliary system…

Analysis of PDEs · Mathematics 2007-05-23 Gerd Grubb , Elmar Schrohe

The main result of this paper is a proof of the continuity of a family of integral functionals defined on the space of functions of bounded variation with respect to a topology under which smooth functions are dense. These functionals occur…

Analysis of PDEs · Mathematics 2014-11-24 Filip Rindler , Giles Shaw

Finding necessary and sufficient conditions for isomorphism between two semigroups of order-preserving transformations over an infinite domain with restricted range was an open problem in \cite{FHQS}. In this paper, we show a proof strategy…

Rings and Algebras · Mathematics 2015-07-10 Phichet Jitjankarn , Thitarie Rungratgasame

We develop a version of Herbrand's theorem for continuous logic and use it to prove that definable functions in infinite-dimensional Hilbert spaces are piecewise approximable by affine functions. We obtain similar results for definable…

Logic · Mathematics 2011-07-20 Isaac Goldbring

Our contribution is a bounded cubic compilation theorem. For each fixed resource parameter $k$, syntactic proof checking at resource level $k$ is faithfully represented by a finite bounded-domain system of cubic polynomial equations. Every…

Logic · Mathematics 2026-04-29 Milan Rosko
‹ Prev 1 4 5 6 7 8 10 Next ›