English
Related papers

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

200 papers

In high-dimensional learning, models remain stable until they collapse abruptly once the sample size falls below a critical level. This instability is not algorithm-specific but a geometric mechanism: when the weakest Fisher eigendirection…

Machine Learning · Statistics 2025-11-26 William Hao-Cheng Huang

We prove the first unconditional consistency result for superpolynomial circuit lower bounds with a relatively strong theory of bounded arithmetic. Namely, we show that the theory V$^0_2$ is consistent with the conjecture that NEXP…

Computational Complexity · Computer Science 2023-08-29 Albert Atserias , Sam Buss , Moritz Müller

We establish uniform Lipschitz estimates for second-order elliptic systems in divergence form with rapidly oscillating, almost-periodic coefficients. We give interior estimates as well as estimates up to the boundary in bounded…

Analysis of PDEs · Mathematics 2014-09-29 Scott N. Armstrong , Zhongwei Shen

We construct a class of Fourier multipliers whose associated operators are weak (1,1) bounded but fail to be weak (p, p) bounded for any 1 < p \leq \infty. Moreover, we show that this result is sharp.

Functional Analysis · Mathematics 2025-12-02 Arup Maity

Let $q=p^r$ be a power of an odd prime $p$. We study binary sequences $\sigma=(\sigma_0,\sigma_1,\ldots)$ with entries in $\{0,1\}$ defined by using the quadratic character $\chi$ of the finite field $\mathbb{F}_q$: $$ \sigma_n=\left\{…

Cryptography and Security · Computer Science 2019-01-30 Zhixiong Chen , Qiuyan Wang

We present a class of multiplicative functions $f:\mathbb{N}\to\mathbb{C}$ with bounded partial sums. The novelty here is that our functions do not need to have modulus bounded by $1$. The key feature is that they pretend to be the constant…

Number Theory · Mathematics 2022-07-11 Marco Aymone

In this paper, we investigate the Dirichlet problem on lower dimensional manifolds for a class of weighted elliptic equations with coefficients that are singular on such sets. Specifically, we study the problem \[\begin{cases} -{\rm…

Analysis of PDEs · Mathematics 2025-10-10 Gabriele Fioravanti

In a previous paper we considered a class of infinitely degenerate quasilinear equations and derived a priori bounds for high order derivatives of solutions in terms of the Lipschitz norm. We now show that it is possible to obtain bounds…

Analysis of PDEs · Mathematics 2011-03-17 Cristian Rios , Eric Sawyer , Richard Wheeden

We study the extension of Presburger arithmetic by the class of sub-polynomial Hardy field functions, and show the majority of these extensions to be undecidable. More precisely, we show that the theory $\mathrm{Th}(\mathbb{Z}; <, +,…

Logic in Computer Science · Computer Science 2025-08-27 Hera Brown , Jakub Konieczny

One of the first and easy to use techniques for proving run time bounds for evolutionary algorithms is the so-called method of fitness levels by Wegener. It uses a partition of the search space into a sequence of levels which are traversed…

Neural and Evolutionary Computing · Computer Science 2024-08-29 Benjamin Doerr , Timo Kötzing

This paper studies the complexity of languages of finite words using automata theory. To go beyond the class of regular languages, we consider infinite automata and the notion of state complexity defined by Karp. Motivated by the seminal…

Formal Languages and Automata Theory · Computer Science 2019-12-25 Nathanaël Fijalkow

Let $\mathfrak{g}$ be a semisimple complex Lie algebra of finite dimension and $\mathfrak{h}$ be a semisimple subalgebra. We present an approach to find the branching rules for the pair $\mathfrak{g}\supset\mathfrak{h}$. According to an…

Representation Theory · Mathematics 2024-07-11 Andrei Gornitskii

We consider the periods of the linear congruential and the power generators modulo $n$ and, for fixed choices of initial parameters, give lower bounds that hold for ``most'' $n$ when $n$ ranges over three different sets: the set of primes,…

Number Theory · Mathematics 2015-06-26 P. Kurlberg , C. Pomerance

It is well known that the weak ($1,1$) bounds doesn't hold for the strong maximal operators, but it still enjoys certain weak $L\log L$ type norm inequality. Let $\Phi_n(t)=t(1+(\log^+t)^{n-1})$ and the space $L_{\Phi_n}({\mathbb R^{n}})$…

Classical Analysis and ODEs · Mathematics 2021-04-09 Moyan Qin , Huoxiong Wu , Qingying Xue

The aim of this paper is to prove existence of weak solutions of hyperbolic-parabolic evolution inclusions defined on Lipschitz domains with mixed boundary conditions describing, for instance, damage processes and elasticity with inertia…

Analysis of PDEs · Mathematics 2016-09-16 Christian Heinemann , Christiane Kraus

A proof for the lower bound is provided for the smallest eigenvalue of finite element equations with arbitrary conforming simplicial meshes. The bound has a similar form as the one by Graham and McLean [SIAM J. Numer. Anal., 44 (2006), pp.…

Numerical Analysis · Mathematics 2021-06-24 Lennard Kamenski

Given any weak Perron number $\lambda$, we construct an end-periodic homeomorphism $f:\Sigma\rightarrow \Sigma$ with Handel-Miller stretch factor equal to $\lambda$ where $\Sigma$ is a connected infinite-type surface with finitely many ends…

Geometric Topology · Mathematics 2026-03-24 Paige Hillen , Marissa Loving , Chenxi Wu

Let $\phi_1,\ldots,\phi_n:[0,1]\to (0,1)$ be Lipschitz contractions. Let $I=[0,1)$, $x_0=0$ and $x_n=1$. We prove that for Lebesgue almost every $(x_1,...,x_{n-1})$ satisfying $0<x_1<\cdots <x_{n-1}<1$, the piecewise contraction $f:I\to I$…

Dynamical Systems · Mathematics 2014-08-08 Arnaldo Nogueira , Benito Pires , Rafael A. Rosales

We prove lower bounds on the complexity of finding $\epsilon$-stationary points (points $x$ such that $\|\nabla f(x)\| \le \epsilon$) of smooth, high-dimensional, and potentially non-convex functions $f$. We consider oracle-based complexity…

Optimization and Control · Mathematics 2019-08-16 Yair Carmon , John C. Duchi , Oliver Hinder , Aaron Sidford

We provide two new methods for computing lower bounds of eigenvalues of symmetric elliptic second-order differential operators with mixed boundary conditions of Dirichlet, Neumann, and Robin type. The methods generalize ideas of Weinstein's…

Numerical Analysis · Mathematics 2017-05-30 Tomáš Vejchodský , Ivana Šebestová
‹ Prev 1 8 9 10 Next ›