English
Related papers

Related papers: Matrix rigidity and the Croot-Lev-Pach lemma

200 papers

We prove local boundedness, Harnack's inequality and local regularity for weak solutions of quasilinear degenerate elliptic equations in divergence form with Rough coefficients. Degeneracy is encoded by a non-negative, symmetric, measurable…

A bar-joint framework $(G,p)$ in Euclidean $d$-space is rigid if the only edge-length-preserving continuous motions arise from isometries of $\mathbb{R}^d$. In the generic case, rigidity is determined by the generic $d$-dimensional rigidity…

Combinatorics · Mathematics 2025-06-30 Rebecca Monks , Anthony Nixon

We study the complexity of reasoning in abstracts argumentation frameworks close to graph classes that allow for efficient reasoning methods, i.e.\ to one of the classes of acyclic, noeven, biparite and symmetric AFs. In this work we show…

Artificial Intelligence · Computer Science 2015-03-19 Wolfgang Dvořák

This is the third paper in our series of five in which we test the Master Constraint Programme for solving the Hamiltonian constraint in Loop Quantum Gravity. In this work we analyze models which, despite the fact that the phase space is…

General Relativity and Quantum Cosmology · Physics 2009-11-10 Bianca Dittrich , Thomas Thiemann

The recently developed proof of Fermat's Last Theorem is very lengthy and difficult, so much so as to be beyond all but a small body of specialists. While certainly of value in the developments that resulted, that proof could not be, nor…

General Mathematics · Mathematics 2007-05-23 Roger Ellman

A while ago MLC (the conjecture that the Mandelbrot set is locally connected) was proven for quasi-hyperbolic points by Douady and Hubbard, and for boundaries of hyperbolic components by Yoccoz. More recently Yoccoz proved MLC for all at…

Dynamical Systems · Mathematics 2016-09-06 Mikhail Lyubich

This is an expository paper on Lyapunov stability of equilibria of autonomous Hamiltonian systems. Our aim is to clarify the concept of weak instability, namely instability without non-constant motions which have the equilibrium as limit…

Dynamical Systems · Mathematics 2012-10-05 Gaetano Zampieri

Starting from the definition of a stiffness matrix, the authors present a new formulation of the Cartesian stiffness matrix of parallel mechanisms. The proposed formulation is more general than any other stiffness matrix found in the…

Classical Physics · Physics 2012-12-07 Cyril Quennouelle , Clément M. Gosselin

We show a number of fine-grained hardness results for the Closest Vector Problem in the $\ell_p$ norm ($\mathrm{CVP}_p$), and its approximate and non-uniform variants. First, we show that $\mathrm{CVP}_p$ cannot be solved in…

Computational Complexity · Computer Science 2021-08-10 Divesh Aggarwal , Huck Bennett , Alexander Golovnev , Noah Stephens-Davidowitz

We extend the definition of $n$-dimensional difference equations to complex order $\alpha\in \mathbb{C} $. We investigate the stability of linear systems defined by an $n$-dimensional matrix $A$ and derive conditions for the stability of…

Dynamical Systems · Mathematics 2022-08-29 Sachin Bhalekar , Prashant M. Gade , Divya Joshi

Matrix rank minimization problems are gaining a plenty of recent attention in both mathematical and engineering fields. This class of problems, arising in various and across-discipline applications, is known to be NP-hard in general. In…

Optimization and Control · Mathematics 2010-10-06 Yun-Bin Zhao

Stability is a well investigated concept in extremal combinatorics. The main idea is that if some object is close in size to an extremal object, then it retains the structure of the extremal construction. In the present paper we study…

Combinatorics · Mathematics 2024-11-13 Richard P. Anstee , Benjamin Kreiswirth , Bowen Li , Attila Sali , Jaehwan Seok

This work extends weak KAM theory to the case of a nonsmooth Lagrangian satisfying a superlinear growth condition. Using the solution of a weak KAM equation that is a stationary Hamilton-Jacobi equation and the proximal aiming method, we…

Optimization and Control · Mathematics 2025-12-01 Yurii Averboukh

Let $D(n)$ be the maximal determinant for $n \times n$ $\{\pm 1\}$-matrices, and ${\mathcal R}(n) = D(n)/n^{n/2}$ be the ratio of $D(n)$ to the Hadamard upper bound. We give several new lower bounds on ${\mathcal R}(n)$ in terms of $d$,…

Combinatorics · Mathematics 2016-10-26 Richard P. Brent , Judy-anne H. Osborn , Warren D. Smith

There has recently been ample interest in the question of which sets can be represented by linear matrix inequalities (LMIs). A necessary condition is that the set is rigidly convex, and it has been conjectured that rigid convexity is also…

Rings and Algebras · Mathematics 2012-04-18 Petter Brändén

The Strong Exponential Time Hypothesis (SETH) asserts that for every $\varepsilon>0$ there exists $k$ such that $k$-SAT requires time $(2-\varepsilon)^n$. The field of fine-grained complexity has leveraged SETH to prove quite tight…

Computational Complexity · Computer Science 2022-11-30 Tatiana Belova , Alexander Golovnev , Alexander S. Kulikov , Ivan Mihajlin , Denil Sharipov

In 1967, Schmidt wrote a seminal paper [10] on heights of subspaces of R n or C n defined over a number field K, and diophantine approximation problems. The going-down Theorem -- one of the main theorems he proved in his paper -- remains…

Number Theory · Mathematics 2017-09-18 Anthony Poels

The Las Vergnas' strong map conjecture, states that any strong map of oriented matroids $f:\mathcal{M}_1\rightarrow\mathcal{M}_2$ can be factored into extensions and contractions. The conjecture is known to be false due to a construction by…

Combinatorics · Mathematics 2019-04-23 Pei Wu

We consider a fluid-structure interaction problem with Navier-slip boundary conditions in which the fluid is considered as a non-Newtonian fluid and the structure is described by a nonlinear multi-layered model. The fluid domain is driven…

Analysis of PDEs · Mathematics 2021-02-02 Wenjun Liu , Yadong Liu , Jun Yu

Recent work [BGS17,ABGS19] has shown SETH hardness of CVP in the $\ell_p$ norm for any $p$ that is not an even integer. This result was shown by giving a Karp reduction from $k$-SAT on $n$ variables to CVP on a lattice of rank $n$. In this…

Computational Complexity · Computer Science 2023-11-28 Divesh Aggarwal , Rajendra Kumar