English
Related papers

Related papers: Subclasses of Presburger Arithmetic and the Weak E…

200 papers

We study an {\it indefinite weighted eigenvalue problem} for an operator of {\it mixed-type} (that includes both the classical {\it $p$-Laplacian} and the {\it fractional $p$-Laplacian}) in a bounded open subset $\Omega\subset \mathbb{R}^N…

Analysis of PDEs · Mathematics 2024-09-04 R. Lakshmi , Ratan Kr. Giri , Sekhar Ghosh

We show that the singular set $\Sigma$ in the classical obstacle problem can be locally covered by a $C^\infty$ hypersurface, up to an "exceptional" set $E$, which has Hausdorff dimension at most $n-2$ (countable, in the $n=2$ case).…

Analysis of PDEs · Mathematics 2024-12-18 Federico Franceschini , Wiktoria Zatoń

We prove new lower bounds on the maximum size of subsets $A\subseteq \{1,\dots,N\}$ or $A\subseteq \mathbb{F}_p^n$ not containing three-term arithmetic progressions. In the setting of $\{1,\dots,N\}$, this is the first improvement upon a…

Number Theory · Mathematics 2024-06-19 Christian Elsholtz , Zach Hunter , Laura Proske , Lisa Sauermann

We consider the compact case of one-dimensional quantum Zakharov system, as an initial-value problem with periodic boundary conditions. We apply the Bourgain norm method to show low regularity local well-posedness for a certain class of…

Analysis of PDEs · Mathematics 2026-02-23 Brian J Choi

For each $1\leq i \le n$, let $k_i\geq 1$ and let $\Delta_i$ be a set of vertices of a non-degenerate simplex of $k_i+1$ points in $\mathbb{R}^{k_i+1}$. If $A\subseteq [0,1]^{k_1+1}\times \cdots \times [0,1]^{k_n+1}$ is a Lebesgue…

Combinatorics · Mathematics 2022-06-22 Polona Durcik , Mario Stipčić

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 study the spectrum of forcing notions between the iterations of $\sigma$-closed followed by ccc forcings and the proper forcings. This includes the hierarchy of $\alpha$-proper forcings for indecomposable countable ordinals as well as…

Logic · Mathematics 2011-02-14 David Aspero , Sy-David Friedman , Miguel Angel Mota , Marcin Sabok

Let $\mathsf{KP}$ denote Kripke-Platek Set Theory and let $\mathsf{M}$ be the weak set theory obtained from $\mathsf{ZF}$ by removing the collection scheme, restricting separation to $\Delta_0$-formulae and adding an axiom asserting that…

Logic · Mathematics 2025-08-28 Zachiri McKenzie

The class of $(d-1)$-dimensional Buchsbaum* simplicial complexes is studied. It is shown that the rank-selected subcomplexes of a (completely) balanced Buchsbaum* simplicial complex are also Buchsbaum*. Using this result, lower bounds on…

Combinatorics · Mathematics 2010-02-08 Jonathan Browder , Steven Klee

Let $k\ge 2$ and let $X$ be a subset of the natural numbers that is $k$-automatic and not eventually periodic. We show that the following dichotomy holds: either all $k$-automatic subsets are definable in the expansion of Presburger…

Logic · Mathematics 2026-05-14 Jason Bell , Alexi Block Gorman , Chris Schulz

We investigate the expressive power of quantifier alternation hierarchy of first-order logic over words. This hierarchy includes the classes ${\Sigma}_i$ (sentences having at most $i$ blocks of quantifiers starting with an $\exists$) and…

Formal Languages and Automata Theory · Computer Science 2015-12-01 Théo Pierron , Thomas Place , Marc Zeitoun

We stratify intuitionistic first-order logic over $(\forall,\to)$ into fragments determined by the alternation of positive and negative occurrences of quantifiers (Mints hierarchy). We study the decidability and complexity of these…

Logic in Computer Science · Computer Science 2019-03-14 Aleksy Schubert , Paweł Urzyczyn , Konrad Zdanowski

By a formula of Farber the topological complexity TC(X) of a (p-1)-connected, m-dimensional CW-complex X is bounded above by (2m+1)/p+1. There are also various lower estimates for TC(X) such as the nilpotency of the ring $H^*(X\times…

Algebraic Topology · Mathematics 2012-10-24 Aleksandra Franc , Petar Pavešić

We prove mixed weak estimates of Sawyer type for fractional operators. More precisely, let $\mathcal{T}$ be either the maximal fractional function $M_\gamma$ or the fractional integral operator $I_\gamma$, $0<\gamma<n$, $1\leq p<n/\gamma$…

Analysis of PDEs · Mathematics 2017-12-25 Fabio Berra , Marilina Carena , Gladis Pradolini

Testing isomorphism of infinite groups is a classical topic, but from the complexity theory viewpoint, few results are known. S{\'e}nizergues and the fifth author (ICALP2018) proved that the isomorphism problem for virtually free groups is…

Group Theory · Mathematics 2022-01-19 Heiko Dietrich , Murray Elder , Adam Piggott , Youming Qiao , Armin Weiß

For $0<s<1$, we consider the nonlocal equation $(-\Delta)^s u = f$ over a Reifenberg flat domain $\Omega$ with $f \in C({\overline{\Omega}})$ and null Dirichlet exterior condition. Given $\alpha \in (0,s)$, we prove that weak solutions are…

Analysis of PDEs · Mathematics 2025-01-27 Adriano Prade

We prove a \emph{query complexity} lower bound for approximating the top $r$ dimensional eigenspace of a matrix. We consider an oracle model where, given a symmetric matrix $\mathbf{M} \in \mathbb{R}^{d \times d}$, an algorithm…

Machine Learning · Computer Science 2020-06-30 Max Simchowitz , Ahmed El Alaoui , Benjamin Recht

It is established the existence and multiplicity of weak solutions for a class of nonlocal equations involving the fractional laplacian, nonlinearities with critical exponential growth and potentials this is which may change sign. The…

Analysis of PDEs · Mathematics 2014-11-19 Manassés de Souza , Yane Lisley Araújo

We consider weak solutions $u:\Omega_{T}\rightarrow\mathbb{R}^{N}$ to parabolic systems of the type \[ u_{t}-\mathrm{div}\,A(x,t,Du)=f \qquad \mathrm{in}\ \Omega_{T}=\Omega\times(0,T), \] where $\Omega$ is a bounded open subset of…

Analysis of PDEs · Mathematics 2024-05-22 Pasquale Ambrosio , Fabian Bäuerlein

We provide a new proof of ``most" cases of the polynomial Wiener-Wintner theorem for $\sigma$-finite spaces, using hard-analytic methods. Specifically, we prove that whenever $(X,\mu,T)$ is a $\sigma$-finite measure-preserving system, and…

Dynamical Systems · Mathematics 2025-11-05 Ben Krause