English
Related papers

Related papers: Localized versions of extremal problems

200 papers

Two generalizations of Hagge's theorems are described. In the first we consider what happens when one moves from the orthocentre to a general point. What one loses by doing so is the indirect similarity and hence one loses the centre of…

Metric Geometry · Mathematics 2010-07-19 Christopher J Bradley

In this paper, we study the extremal problem for the Strichartz inequality for the Schr\"{o}dinger equation on $\mathbb{R}^2$. We show that the solutions to the associated Euler-Lagrange equation are exponentially decaying in the Fourier…

Analysis of PDEs · Mathematics 2021-01-05 Ryan Frier , Shuanglin Shao

We systematically study the moduli theory of symplectic varieties (in the sense of Beauville) which admit a resolution by an irreducible symplectic manifold. In particular, we prove an analog of Verbitsky's global Torelli theorem for the…

Algebraic Geometry · Mathematics 2021-01-07 Benjamin Bakker , Christian Lehn

Generalized \dK modules are introduced to solve an open problem: the odd Ext-module $\Eod(M)$ of a \dK module $M$ over a $d$-Koszul algebra $\m$ is a \K module over the even Yoneda algebra $\Eev(\m)$.

Rings and Algebras · Mathematics 2011-09-09 Ning Bian , Yu Ye , Pu Zhang

We introduce a notion of probabilistic convexity and generalize some classical globalization theorems in Alexandrov geometry. A weighted Alexandrov's lemma is developed as a basic tool.

Differential Geometry · Mathematics 2015-06-24 Nan Li

We consider a generalisation of the classical Lehmer problem about the distribution of modular inverses in arithmetic progression, introduced by E. Alkan, F. Stan and A. Zaharescu. Using bounds of sums of multiplicative characters instead…

Number Theory · Mathematics 2007-05-23 Igor Shparlinski

Erd\"{o}s and Tur\'{a}n once conjectured that any set $A\subset\mathbb{N}$ with $\sum_{a\in A}{1}/{a}=\infty$ should contain infinitely many progressions of arbitrary length $k\geq3$. For the two-dimensional case Graham conjectured that if…

Number Theory · Mathematics 2007-05-23 Liangpan Li

Many classical theorems in combinatorics establish the emergence of substructures within sufficiently large collections of objects. Well-known examples are Ramsey's theorem on monochromatic subgraphs and the Erd\H{o}s-Rado sunflower lemma.…

Computational Complexity · Computer Science 2022-09-13 Romain Bourneuf , Lukáš Folwarczný , Pavel Hubáček , Alon Rosen , Nikolaj Ignatieff Schwartzbach

Standard singularity theorems are proven in Lorentzian manifolds of arbitrary dimension n if they contain closed trapped submanifolds of arbitrary co-dimension. By using the mean curvature vector to characterize trapped submanifolds, a…

General Relativity and Quantum Cosmology · Physics 2014-11-21 Gregory J. Galloway , José M. M. Senovilla

Given a number field $k$, we show that, for many finite groups $G$, all the Galois extensions of $k$ with Galois group $G$ cannot be obtained by specializing any given finitely many Galois extensions $E/k(T)$ with Galois group $G$ and $E/k$…

Number Theory · Mathematics 2017-10-25 Joachim König , François Legrand

We study the generalized Ramsey--Tur\'an function $\mathrm{RT}(n,K_s,K_t,o(n))$, which is the maximum possible number of copies of $K_s$ in an $n$-vertex $K_t$-free graph with independence number $o(n)$. The case when $s=2$ was settled by…

Combinatorics · Mathematics 2024-03-20 Jun Gao , Suyun Jiang , Hong Liu , Maya Sankar

According to the Erd\H{o}s-Szekeres theorem, for every $n$, a sufficiently large set of points in general position in the plane contains $n$ in convex position. In this note we investigate the line version of this result, that is, we want…

Metric Geometry · Mathematics 2015-04-20 Imre Bárány , Edgardo Roldán-Pensado , Géza Tóth

Using Schmidt's Subspace Theorem, this paper improves and extends an existing transcendence result for sequences of algebraic numbers. The theorems thus produced correspond to a central theorem on the irrationality of sequences due to…

Number Theory · Mathematics 2025-03-18 Mathias L. Laursen

The Generalized Central Limit Theorem is a remarkable generalization of the Central Limit Theorem, showing that the sum of a large number of independent, identically-distributed (i.i.d) random variables with infinite variance may converge…

Statistical Mechanics · Physics 2020-02-19 Ariel Amir

The differential $\lambda$-calculus studies how the quantitative aspects of programs correspond to differentiation and to Taylor expansion inside models of linear logic. Recent work has generalized the axioms of Taylor expansion so they…

Logic in Computer Science · Computer Science 2026-03-27 Christine Tasson , Aymeric Walch

In this paper we define a class of combinatorial structures the instances of which can each be thought of as a model of directed hypergraphs in some way. Each of these models is uniform in that all edges have the same internal structure,…

Combinatorics · Mathematics 2016-07-19 Alex Cameron

In this paper, we generalize the classical extragradient algorithm for solving variational inequality problems by utilizing nonzero normal vectors of the feasible set. In particular, conceptual algorithms are proposed with two different…

Optimization and Control · Mathematics 2019-02-25 J. Y. Bello Cruz , R. Díaz Millán , Hung M. Phan

Two Theorems attributed to Hilbert-Weierstrass and Tonelli-Morrey respectively are two classical studies for the regularity discussion around the solutions of some problems in the realm of Calculus of Variations. Now, since differential…

Optimization and Control · Mathematics 2022-07-01 Saman Khoramian

We give a proof of the Erd\H{o}s-Ko-Rado Theorem using the Borel Fixed Point Theorem from algebraic group theory. This perspective gives a strong analogy between the Erd\H{o}s-Ko-Rado Theorem and (generalizations of) the Gerstenhaber…

Combinatorics · Mathematics 2024-11-06 Russ Woodroofe

In 1964, Erd\H{o}s, Hajnal and Moon introduced a saturation version of Tur\'an's classical theorem in extremal graph theory. In particular, they determined the minimum number of edges in a $K_r$-free, $n$-vertex graph with the property that…

Combinatorics · Mathematics 2020-05-05 Gábor Damásdi , Balázs Keszegh , David Malec , Casey Tompkins , Zhiyu Wang , Oscar Zamora