中文
相关论文

相关论文: Subclasses of Presburger Arithmetic and the Weak E…

200 篇论文

We prove a local minimizing property for strictly stable free-boundary minimal hypersurfaces in the relative current setting. Let $\Sigma^n$ be a compact, two-sided, properly embedded free-boundary minimal hypersurface in a compact…

微分几何 · 数学 2026-05-26 Xiaoxiang Jiao , Hangyue Zhu

The three dimensional primitive equations with full viscosity are considered in a horizontally periodic box $\Omega$, which are subject to either the homogeneous Neumann or Dirichlet conditions on the upper and bottom parts of the boundary.…

偏微分方程分析 · 数学 2026-01-15 Takahito Kashiwabara

This work resolves the open problem of strong singularity ($\alpha(z)> 1$) in nonlocal Kirchhoff-type equations with variable exponents through five original theorems that collectively establish a comprehensive theory. Beginning with…

偏微分方程分析 · 数学 2026-03-31 M. H. M. Rashid

We reduce the leading term in Lehman's theorem. This improved estimate allows us to refine the main theorem of Bays and Hudson. Entering $2,000,000$ Riemann zeros, we prove that there exists $x$ in the interval $[exp(727.951858),…

数论 · 数学 2009-03-23 Kuok Fai Chao , Roger Plymen

We investigate the end extendibility of models of arithmetic with restricted elementarity. By utilizing the restricted ultrapower construction in the second-order context, for each $n\in\mathbb{N}$ and any countable model of…

逻辑 · 数学 2024-09-12 Mengzhou Sun

We establish existence, uniqueness and optimal regularity results for very weak solutions to certain nonlinear elliptic boundary value problems. We introduce structural asymptotic assumptions of Uhlenbeck type on the nonlinearity, which are…

偏微分方程分析 · 数学 2016-08-03 Miroslav Bulíček , Lars Diening , Sebastian Schwarzacher

We investigate the complexity consequences of adding pointer arithmetic to separation logic. Specifically, we study extensions of the points-to fragment of symbolic-heap separation logic with various forms of Presburger arithmetic…

计算机科学中的逻辑 · 计算机科学 2018-03-09 James Brotherston , Max Kanovich

A famous conjecture of Graham asserts that every set $A \subseteq \mathbb{Z}_p \setminus \{0\}$ can be ordered so that all partial sums are distinct. Although this conjecture was recently proved for sufficiently large primes by Pham and…

组合数学 · 数学 2026-02-24 Simone Costa , Stefano Della Fiore

We provide polynomial lower bounds for residual finiteness of residually finite, finitely generated solvable groups that admit infinite order elements in the Fitting subgroup of strict distortion at least exponential. For this class of…

群论 · 数学 2019-12-03 Mark Pengitore

We derive a priori bounds for the $\Phi^4$ equation in the full sub-critical regime using Hairer's theory of regularity structures. The equation is formally given by \begin{equation} \label{e}(\partial_t-\Delta)\phi = -\phi^3 + \infty \phi…

偏微分方程分析 · 数学 2019-12-05 Ajay Chandra , Augustin Moinat , Hendrik Weber

We identify a fragment of Presburger arithmetic enriched with free function symbols and cardinality constraints for interpreted sets, which is amenable to automated analysis. We establish decidability and complexity results for such a…

计算机科学中的逻辑 · 计算机科学 2016-02-02 Francesco Alberti , Silvio Ghilardi , Elena Pagani

We show that there is a language in $\mathsf{S}_2\mathsf{E}/_1$ (symmetric exponential time with one bit of advice) with circuit complexity at least $2^n/n$. In particular, the above also implies the same near-maximum circuit lower bounds…

计算复杂性 · 计算机科学 2023-09-25 Lijie Chen , Shuichi Hirahara , Hanlin Ren

$ \newcommand{\eps}{\epsilon} \newcommand{\NP}{\mathsf{NP}} \newcommand{\YES}{\mathsf{YES}} \newcommand{\NO}{\mathsf{NO}} \newcommand{\myminus}{\text{-}}\newcommand{\Bsat}{{\mathsf{B}}} \newcommand{\threesat}{\rm{3}\myminus\mathsf{SAT}}…

计算复杂性 · 计算机科学 2018-06-12 Ishay Haviv , Oded Regev , Amnon Ta-Shma

We consider an expansion of Presburger arithmetic which allows multiplication by $k$ parameters $t_1,\ldots,t_k$. A formula in this language defines a parametric set $S_\mathbf{t} \subseteq \mathbb{Z}^{d}$ as $\mathbf{t}$ varies in…

逻辑 · 数学 2018-02-06 Tristram Bogart , John Goodrick , Danny Nguyen , Kevin Woods

We obtain a lower bound for the period of periodic solutions of semilinear evolution equations for the full range of nonlinear terms for which standard local existence theory applies. This lower bound depends on the Lipschitz constant of…

偏微分方程分析 · 数学 2012-12-21 James C. Robinson , Alejandro Vidal-López

In this work we study global boundedness and exponential integrability of weak solutions to degenerate $p$-Poisson equations using an iterative method of De Giorgi type. Given a symmetric, non-negative definite matrix valued function $Q$…

偏微分方程分析 · 数学 2023-09-11 Sullivan Francis MacDonald , Scott Rodney

We consider the extension of the two-variable guarded fragment logic with local Presburger quantifiers. These are quantifiers that can express properties such as "the number of incoming blue edges plus twice the number of outgoing red edges…

计算机科学中的逻辑 · 计算机科学 2024-09-04 Chia-Hsuan Lu , Tony Tan

This work showcases level set estimates for weak solutions to the $p$-Poisson equation on a bounded domain, which we use to establish Lebesgue space inclusions for weak solutions. In particular we show that if $\Omega\subset\mathbb{R}^n$ is…

偏微分方程分析 · 数学 2023-09-15 Sullivan Francis MacDonald

We consider Presburger arithmetic (PA) extended by scalar multiplication by an algebraic irrational number $\alpha$, and call this extension $\alpha$-Presburger arithmetic ($\alpha$-PA). We show that the complexity of deciding sentences in…

逻辑 · 数学 2023-06-22 Philipp Hieronymi , Danny Nguyen , Igor Pak

Given a first-order theory $T$ formulated in the usual language of first-order arithmetic, we say that $T$ is of *restricted complexity* if there is some natural number $n$ and some set $\mathcal A$ of $\Sigma_n$-sentences such that $T$ can…

逻辑 · 数学 2025-10-01 Ali Enayat , Mateusz Łełyk , Albert Visser