English
Related papers

Related papers: Bootstrapping partition regularity of linear syste…

200 papers

We show the existence of some special coordinate systems for expressing maps with branch points. These coordinates allow obtaining an explicit representation formula of branch immersions and understanding the regularity of some fundamental…

Differential Geometry · Mathematics 2024-08-06 Tito Medina

Let $\mathbb{N}$ be the set of all nonnegative integers. For $S\subseteq \mathbb{N}$ and $n\in \mathbb{N}$, let $R_S(n)$ denote the number of solutions of the equation $n=s_1+s_2$, $s_1,s_2\in S$ and $s_1<s_2$. Let $A$ be the set of all…

Number Theory · Mathematics 2021-11-16 Kai-Jie Jiao , Csaba Sándor , Quan-Hui Yang , Jun-Yu Zhou

We prove partial regularity of stationary solutions and minimizers $u$ from a set $\Omega\subset \mathbb R^n$ to a Riemannian manifold $N$, for the functional $\int_\Omega F(x,u,|\nabla u|^2) dx$. The integrand $F$ is convex and satisfies…

Differential Geometry · Mathematics 2017-08-21 Zahra Sinaei

In proving large deviation estimates, the lower bound for open sets and upper bound for compact sets are essentially local estimates. On the other hand, the upper bound for closed sets is global and compactness of space or an exponential…

Probability · Mathematics 2015-10-20 Chiranjib Mukherjee , S. R. S. Varadhan

This paper presents a novel framework for characterizing dissipativity of uncertain systems whose dynamics evolve according to differential-algebraic equations. Sufficient conditions for dissipativity (specializing to, e.g., stability or…

Systems and Control · Electrical Eng. & Systems 2024-05-13 Emily Jensen , Neelay Junnarkar , Murat Arcak , Xiaofan Wu , Suat Gumussoy

Let $\hil$ be a finite dimensional (real or complex) Hilbert space and let $\{a_i\}_{i=1}^\infty$ be a non-increasing sequence of positive numbers. Given a finite sequence of vectors $\f$ in $\hil$ we find necessary and sufficient…

Functional Analysis · Mathematics 2016-09-07 P. Massey , M. Ruiz

This paper addresses the real structured controllability, stabilizability, and stability radii (RSCR, RSSZR, and RSSR, respectively) of linear systems, which involve determining the distance (in terms of matrix norms) between a (possibly…

Systems and Control · Electrical Eng. & Systems 2023-07-07 Yuan Zhang , Yuanqing Xia , Yufeng Zhan

We discuss the regularity of extremal functions in certain weighted Bergman and Fock type spaces. Given an appropriate analytic function $k$, the corresponding extremal function is the function with unit norm maximizing $\text{Re}…

Complex Variables · Mathematics 2014-11-10 Timothy Ferguson

In this paper we study representations of real numbers in a numeral system with the base $a>1$ and alphabet (digits set) $A\equiv\{0,1,...,r\}$, $a-1<r\in N$ given by \[x=\sum\limits_{n=1}^{\infty}\frac{\alpha_n}{a^n}\equiv…

Number Theory · Mathematics 2026-03-31 S. O. Vaskevych , Yu. Yu. Vovk , O. M. Pratsiovytyi

We study linear extremal problems in the Bergman space $A^p$ of the unit disc, where $1 < p < \infty$. Given a functional on the dual space of $A^p$ with representing kernel $k \in A^q$, where $1/p + 1/q = 1$, we show that if $q \le q_1 <…

Complex Variables · Mathematics 2015-02-09 Timothy Ferguson

We study the 'bad science matrix problem': among all matrices $A\in\mathbb{R}^{n\times n}$ whose rows have unit $\ell_2$-norm, determine the maximum of $\beta(A)=\frac{1}{2^n}\sum_{x\in\{\pm1\}^n}\|Ax\|_\infty$. Steinerberger [1]…

Functional Analysis · Mathematics 2025-09-16 Shridhar Sinha

Fix $R>1$ and let $A_R=\{1/R\le |z|\le R \}$ be an annulus. Also, let $K(R)$ denote the smallest constant such that $A_R$ is a $K(R)$-spectral set for the bounded linear operator $T\in \mathcal{B}(H)$ whenever $||T||\le R$ and…

Functional Analysis · Mathematics 2021-06-02 Georgios Tsikalas

We establish a free analogue of Obata's rigidity theorem. More precisely, Cheng and Zhou (2017) proved that on a weighted Riemannian manifold, the sharp spectral gap (Poincar\'e constant) is achieved only when the space splits isometrically…

Operator Algebras · Mathematics 2026-03-06 Charles-Philippe Diez

Partial rigidity is a quantitative notion of recurrence and provides a global obstruction which prevents the system from being strongly mixing. A dynamical system $(X, \mathcal{X}, \mu, T)$ is partially rigid if there is a constant $\delta…

Dynamical Systems · Mathematics 2024-12-13 Tristán Radić

We study a spectral generalization of classical combinatorial graph spanners to the spectral setting. Given a set of vectors $V\subseteq \Re^d$, we say a set $U\subseteq V$ is an $\alpha$-spectral spanner if for all $v\in V$ there is a…

Data Structures and Algorithms · Computer Science 2019-11-19 Piotr Indyk , Sepideh Mahabadi , Shayan Oveis Gharan , Alireza Rezaei

We prove that any vector bundle computing the rank-two Clifford index of a smooth projective algebraic curve is linearly semistable. We also identify conditions under which such bundles become linearly stable, thereby addressing a question…

Algebraic Geometry · Mathematics 2025-09-11 Ali Bajravani , Angela Ortega

We prove that the extremum stack of a discrete sequence is a minimal sufficient statistic for the class of all computable, causal, rate-independent functionals, in the sense of Kolmogorov complexity. Specifically, we establish K(Pi_n) -…

Information Theory · Computer Science 2026-05-20 Piotr Frydrych

For any positive integer $m$, let $\mathbb{Z}_{m}$ be the set of residue classes modulo $m$. For $A\subseteq \mathbb{Z}_{m}$ and $\overline{n}\in \mathbb{Z}_{m}$, let $R_{A}(\overline{n})$ denote the number of solutions of…

Number Theory · Mathematics 2020-07-02 Cui-Fang Sun , Meng-Chi Xiong

A $n\times n$ matrix $A$ has normal defect one if it is not normal, however can be embedded as a north-western block into a normal matrix of size $(n+1)\times (n+1)$. The latter is called a minimal normal completion of $A$. A construction…

Functional Analysis · Mathematics 2009-03-03 D. S. Kaliuzhnyi-Verbovetskyi , I. M. Spitkovsky , H. J. Woerdeman

We give an approximation algorithm for packing and covering linear programs (linear programs with non-negative coefficients). Given a constraint matrix with n non-zeros, r rows, and c columns, the algorithm computes feasible primal and dual…

Data Structures and Algorithms · Computer Science 2015-06-02 Christos Koufogiannakis , Neal E. Young