中文
相关论文

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

200 篇论文

We prove a cell decomposition theorem for Presburger sets and introduce a dimension theory for Z-groups with the Presburger structure. Using the cell decomposition theorem we obtain a full classification of Presburger sets up to definable…

逻辑 · 数学 2007-05-23 Raf Cluckers

Checking whether two pushdown automata with restricted silent actions are weakly bisimilar was shown decidable by S\'enizergues (1998, 2005). We provide the first known complexity upper bound for this famous problem, in the equivalent…

计算机科学中的逻辑 · 计算机科学 2019-08-20 Petr Jančar , Sylvain Schmitz

We classify the sets of natural numbers $n$ for which certain dynamical systems $(X,f)$ on a compact metric space $X$ have a periodic point of (least) period $n$. Interest in this question dates back to Sharkovskii's theorem for continuous…

动力系统 · 数学 2026-04-27 Huub de Jong

For a finite group $G$ and an integer $r\ge 2$ let $$ P_r(G):=\frac{|Hom(\mathbb Z^r,G)|}{|G|^r}, $$ where $\Hom(\mathbb Z^r,G)$ is the set of pairwise commuting $r$-tuples in $G$. This paper studies rigidity and extremal behavior of the…

群论 · 数学 2026-05-19 Vadim E Levit , Robert Shwartz

In arXiv:2208.12944 it is shown that an ordinal $\sup_{N<\omega}\psi_{\Omega_{1}}(\varepsilon_{\Omega_{\mathbb{S}+N}+1})$ is an upper bound for the proof-theoretic ordinal of a set theory ${\sf KP}\ell^{r}+(M\prec_{\Sigma_{1}}V)$. In this…

逻辑 · 数学 2022-11-17 Toshiyasu Arai

In this paper we analyze a system of N identical quantum particles in a weak-coupling regime. The time evolution of the Wigner transform of the one-particle reduced density matrix is represented by means of a perturbative series. The…

数学物理 · 物理学 2009-11-10 D. Benedetto , F. Castella , R. Esposito , M. Pulvirenti

The $2 q$-th pseudomoment $\Psi_{2q,\alpha}(x)$ of the $\alpha$-th power of the Riemann zeta function is defined to be the $2 q$-th moment of the partial sum up to $x$ of $\zeta^\alpha$ on the critical line. Using probabilistic methods of…

数论 · 数学 2019-09-24 Maxim Gerspach

In this document, some structured operator approximation theoretical methods for system identification of nearly eventually periodic systems, are presented. Let $\mathbb{C}^{n\times m}$ denote the algebra of $n\times m$ complex matrices.…

数值分析 · 数学 2020-01-31 Fredy Vides

A general lower bound is developed for the minimax risk when estimating an arbitrary functional. The bound is based on testing two composite hypotheses and is shown to be effective in estimating the nonsmooth functional…

统计理论 · 数学 2011-05-17 T. Tony Cai , Mark G. Low

We describe a "slow" version of the hierarchy of uniform reflection principles over Peano Arithmetic ($\mathbf{PA}$). These principles are unprovable in Peano Arithmetic (even when extended by usual reflection principles of lower…

逻辑 · 数学 2020-08-06 Anton Freund

For a countably infinite group $\Gamma$, let $\mathcal{W}_\Gamma$ denote the space of all weak equivalence classes of measure-preserving actions of $\Gamma$ on atomless standard probability spaces, equipped with the compact metrizable…

动力系统 · 数学 2019-03-14 Anton Bernshteyn

In this paper we show lower bounds for a certain large class of algorithms solving the Graph Isomorphism problem, even on expander graph instances. Spielman [25] shows an algorithm for isomorphism of strongly regular expander graphs that…

计算复杂性 · 计算机科学 2016-10-31 Aaron Snook , Grant Schoenebeck , Paolo Codenotti

For a finitely generated group $G$ we calculate the Bieri-Neumann-Strebel-Renz invariant $\Sigma^1(\X(G))$ for the weak commutativity construction $\X(G)$. Identifying $S(\X(G))$ with $S(\X(G) / W(G))$ we show $\Sigma^2(\X(G),\Z) \subseteq…

群论 · 数学 2020-10-27 Dessislava H. Kochloukova

Building on the locality conditions for first-order logic by Hanf and Gaifman, Barthelmann and Schwentick showed in 1999 that every first-order formula is equivalent to a formula of the shape $\exists x_1 \dotsc \exists x_k \forall y\,\phi$…

计算机科学中的逻辑 · 计算机科学 2018-10-30 André Frochaux , Lucas Heimberg

We consider nonlinear, scaling-invariant N=1 boson + fermion supersymmetric systems whose right-hand sides are homogeneous differential polynomials and satisfy some natural assumptions. We select the super-systems that admit infinitely many…

可精确求解与可积系统 · 物理学 2007-05-23 A. V. Kiselev , T. Wolf

We give a lower bound on the iteration complexity of a natural class of Lagrangean-relaxation algorithms for approximately solving packing/covering linear programs. We show that, given an input with $m$ random 0/1-constraints on $n$…

数据结构与算法 · 计算机科学 2015-11-23 Phil Klein , Neal E. Young

In this paper we prove the boundedness and H\"older continuity of quasilinear elliptic problems involving variable exponents for a homogeneous Dirichlet and a nonhomogeneous Neumann boundary condition, respectively. The novelty of our work…

偏微分方程分析 · 数学 2022-01-10 Ky Ho , Yun-Ho Kim , Patrick Winkert , Chao Zhang

We study a class of timelike weakly extremal surfaces in flat Minkowski space $\mathbb R^{1+n}$, characterized by the fact that they admit a $C^1$ parametrization (in general not an immersion) of a specific form. We prove that if the…

偏微分方程分析 · 数学 2012-11-15 Robert L. Jerrard , Matteo Novaga , Giandomenico Orlandi

The authors of this paper deal with the existence and regularities of weak solutions to the homogenous $\hbox{Dirichlet}$ boundary value problem for the equation $-\hbox{div}(|\nabla u|^{p-2}\nabla u)+|u|^{p-2}u=\frac{f(x)}{u^{\alpha}}$.…

偏微分方程分析 · 数学 2013-09-04 Bin Guo , Wenjie Gao , Yanchao Gao

We study predictive probability inference in classification tasks using random forests under class imbalance. We focus on two simplified variants of Breiman's algorithm, namely subsampling Infinite Random Forests (IRFs) and under-sampling…

统计理论 · 数学 2025-05-23 Moria Mayala , Olivier Wintenberger , Charles Tillier , Clément Dombry