English
Related papers

Related papers: A note on lower bounds for arithmetic regularity p…

200 papers

The framework of algebraically natural proofs was independently introduced in the works of Forbes, Shpilka and Volk (2018), and Grochow, Kumar, Saks and Saraf (2017), to study the efficacy of commonly used techniques for proving lower…

Computational Complexity · Computer Science 2025-02-04 Prerona Chatterjee , Mrinal Kumar , C Ramya , Ramprasad Saptharishi , Anamay Tengse

We prove an Allard-type regularity theorem for free-boundary minimal surfaces in Lipschitz domains locally modelled on convex polyhedra. We show that if such a minimal surface is sufficiently close to an appropriate free-boundary plane,…

Differential Geometry · Mathematics 2021-05-27 Nicholas Edelen , Chao Li

We establish partial regularity for the $\omega$-minimizers of quasiconvex functionals of power growth. A first-order partial regularity result of $BV$ $\omega$-minimizers is obtained in the linear growth case under a Dini-type condition on…

Analysis of PDEs · Mathematics 2022-05-27 Zhuolin Li

The limit functions generated by quasi-linear functions or sequences (including the sum of the Rudin-Shapiro sequence as an example) are continuous but almost everywhere non-differentiable functions. Their graphs are fractal curves. In 2017…

Metric Geometry · Mathematics 2025-10-20 Wen Wu , Sheng Zhong

Very recently, Bai [Linear Algebra Appl., 681:150-186, 2024 \& Appl. Math. Lett., 166:109510, 2025] studied some concrete structures, and obtained essential algebraic and computational properties of the one-dimensional, two-dimensional and…

Rings and Algebras · Mathematics 2025-06-19 Aaisha Be , Nachiketa Mishra , Debasisha Mishra

Core partitions have attracted much attention since Anderson's work (2002) on the number of $(s,t)$-core partitions for coprime $s,t$. Recently, there has been a growing interest in studying the limiting distributions of the sizes of random…

Probability · Mathematics 2024-12-31 Jiange Li , Yetong Sha , Huan Xiong

In this paper, we study the structure of set-multilinear arithmetic circuits and set-multilinear branching programs with the aim of showing lower bound results. We define some natural restrictions of these models for which we are able to…

Computational Complexity · Computer Science 2015-11-10 V. Arvind , S. Raja

Introduced in the mid-1970's as an intermediate step in proving a long-standing conjecture on arithmetic progressions, Szemer\'edi's regularity lemma has emerged over time as a fundamental tool in different branches of graph theory,…

Computer Vision and Pattern Recognition · Computer Science 2016-09-22 Marcello Pelillo , Ismail Elezi , Marco Fiorucci

We obtain new regularity conditions for problems of calculus of variations with higher-order derivatives. As a corollary, we get non-occurrence of the Lavrentiev phenomenon. Our main regularity result asserts that autonomous integral…

Optimization and Control · Mathematics 2008-07-19 Moulay Rchid Sidi Ammi , Delfim F. M. Torres

In this paper, we prove that every graph with average degree at least $s+t+2$ has a vertex partition into two parts, such that one part has average degree at least $s$, and the other part has average degree at least $t$. This solves a…

Combinatorics · Mathematics 2022-02-17 Yan Wang , Hehui Wu

In the present paper we establish the solvability of the Regularity boundary value problem in domains with (flat and Lipschitz) lower dimensional boundaries for operators whose coefficients exhibit small oscillations analogous to the…

Analysis of PDEs · Mathematics 2022-08-02 Zanbing Dai , Joseph Feneuil , Svitlana Mayboroda

The aim of this paper is to develop the regularity theory for a weak solution to a class of quasilinear nonhomogeneous elliptic equations, whose prototype is the following mixed Dirichlet $p$-Laplace equation of type \begin{align*}…

Analysis of PDEs · Mathematics 2020-03-12 Thanh-Nhan Nguyen , Minh-Phuong Tran

We study asymptotics of perfect matchings on a large class of graphs called the contracting square-hexagon lattice, which is constructed row by row from either a row of a square grid or a row of a hexagonal lattice. We assign the graph…

Probability · Mathematics 2020-09-01 Cédric Boutillier , Zhongyang Li

This is an expository note answering a question posed to us by Richard Stanley, in which we prove a limit shape theorem for partitions of $n$ which maximize the number of subpartitions. The limit shape and the growth rate of the number of…

Probability · Mathematics 2020-01-29 Ivan Corwin , Shalin Parekh

A famous theorem of Szemer\'edi asserts that all subsets of the integers with positive upper density will contain arbitrarily long arithmetic progressions. There are many different proofs of this deep theorem, but they are all based on a…

Number Theory · Mathematics 2007-05-23 Terence Tao

We study the regularity and the algebraic properties of certain lattice ideals. We establish a map I --> I\~ between the family of graded lattice ideals in an N-graded polynomial ring over a field K and the family of graded lattice ideals…

Commutative Algebra · Mathematics 2015-01-12 Jorge Neves , Maria Vaz Pinto , Rafael H. Villarreal

We continue the study initiated by H. S. Shapiro on Fischer decompositions of entire functions, showing that such decomposition exist in a weak sense (we do not prove uniqueness) under hypotheses regarding the order of the entire function…

Analysis of PDEs · Mathematics 2024-03-18 J. M. Aldaz , H. Render

We show how to infer sharp partial regularity results for relaxed minimizers of degenerate, nonuniformly elliptic quasiconvex functionals, using tools from Nonlinear Potential Theory. In particular, in the setting of functionals with…

Analysis of PDEs · Mathematics 2022-04-12 Cristiana De Filippis

This paper studies explicit and theoretical bounds for several interesting quantities in number theory, conditionally on the Generalized Riemann Hypothesis. Specifically, we improve the existing explicit bounds for the least quadratic…

Number Theory · Mathematics 2016-12-12 Youness Lamzouri , Xiannan Li , Kannan Soundararajan

We introduce the polynomial coefficient matrix and identify maximum rank of this matrix under variable substitution as a complexity measure for multivariate polynomials. We use our techniques to prove super-polynomial lower bounds against…

Computational Complexity · Computer Science 2013-02-15 Mrinal Kumar , Gaurav Maheshwari , Jayalal Sarma M. N