English
Related papers

Related papers: On idempotent ultrafilters in higher-order reverse…

200 papers

Several authors have considered whether the ultrapower and the relative commutant of a C*-algebra or II_1 factor depend on the choice of the ultrafilter. We settle each of these questions, extending results of Ge-Hadwin and the first…

Operator Algebras · Mathematics 2014-02-26 Ilijas Farah , Bradd Hart , David Sherman

The notion of the ultrametrics can be considered as a zero-dimensional analogue of ordinary metrics, and it is expected to prove ultrametric versions of theorems on metric spaces. In this paper, we provide ultrametric versions of the…

Metric Geometry · Mathematics 2021-03-12 Yoshito Ishiki

We extend some classical constructions in commutative algebra to the setting of modules over orders in (non-commutative) semisimple algebras. Our theory incorporates, inter alia, `reduced' versions of the notions of higher Fitting…

Number Theory · Mathematics 2025-09-16 David Burns , Takamichi Sano

We prove an effective version of the inverse theorem for the Gowers $U^3$-norm for functions supported on high-rank quadratic level sets in finite vector spaces. For configurations controlled by the $U^3$-norm (complexity-two…

Combinatorics · Mathematics 2024-09-13 Sean Prendiville

We prove an inequality on positive real numbers, that looks like a reverse to the well-known Hilbert inequality, and we use some unusual techniques from Fourier analysis to prove that this inequality is optimal.

Classical Analysis and ODEs · Mathematics 2017-01-09 Omran Kouba

We consider convex sets and functions over idempotent semifields, like the max-plus semifield. We show that if $K$ is a conditionally complete idempotent semifield, with completion $\bar{K}$, a convex function $K^n\to\bar{K}$ which is lower…

Functional Analysis · Mathematics 2007-05-23 Guy Cohen , Stephane Gaubert , Jean-Pierre Quadrat , Ivan Singer

We show that when certain statements are provable in subsystems of constructive analysis using intuitionistic predicate calculus, related sequential statements are provable in weak classical subsystems. In particular, if a $\Pi^1_2$…

Logic · Mathematics 2012-01-25 Jeffry L. Hirst , Carl Mummert

The central purpose of this article is to establish new inverse and implicit function theorems for differentiable maps with isolated critical points. One of the key ingredients is a discovery of the fact that differentiable maps with…

Classical Analysis and ODEs · Mathematics 2021-04-02 Liangpan Li

This paper deals with the subject of infinitesimal variations of Euclidean submanifolds with arbitrary dimension and codimension. The main goal is to establish a Fundamental theorem for these geometric objects. Similar to the theory of…

Differential Geometry · Mathematics 2020-07-15 M. Dajczer , M. I. Jimenez

We study the unique recovery of time-independent lower order terms appearing in the symmetric first order perturbation of the Riemannian wave equation by sending and measuring waves in disjoint open sets of \textit{a priori} known closed…

Analysis of PDEs · Mathematics 2025-10-30 Matti Lassas , Boya Liu , Teemu Saksala , Andrew Shedlock , Ziyao Zhao

Exacting and ultraexacting cardinals are large cardinal numbers compatible with the Zermelo-Fraenkel axioms of set theory, including the Axiom of Choice. In contrast with standard large cardinal notions, their existence implies that the…

Logic · Mathematics 2025-09-15 Juan Pablo Aguilera , Joan Bagaria , Gabriel Goldberg , Philipp Lücke

We introduce the definability strength of combinatorial principles. In terms of definability strength, a combinatorial principle is strong if solving a corresponding combinatorial problem could help in simplifying the definition of a…

Logic · Mathematics 2017-02-28 Wei Wang

Matroids generalize the familiar notion of linear dependence from linear algebra. Following a brief discussion of founding work in computability and matroids, we use the techniques of reverse mathematics to determine the logical strength of…

Logic · Mathematics 2016-04-19 Jeffry L. Hirst , Carl Mummert

This paper presents analogous results of Hua [7][8] on numbers of representations of quivers over finite fields which respect nilpotent relations under certain assumptions. A closed formula which counts isomorphism classes of absolutely…

Representation Theory · Mathematics 2021-05-06 Bangming Deng , Jiuzhao Hua

This note answers the following question: Is it consistent that for an arbitrary tall summable ideal I_g there exists an I_g-ultrafilter which is not rapid? We show that assuming Martin's Axiom for \sigma-centered posets such ultrafilters…

Logic · Mathematics 2012-08-21 Jana Flašková

Boolean ultrapowers extend the classical ultrapower construction to work with ultrafilters on any complete Boolean algebra, rather than only on a power set algebra. When they are well-founded, the associated Boolean ultrapower embeddings…

Logic · Mathematics 2015-03-20 Joel David Hamkins , Daniel Evan Seabold

We consider the inverse problem of identification of degenerate diffusion coefficient of the form $x^\alpha a(x)$ in a one dimensional parabolic equation by some extra data. We first prove by energy methods the uniqueness and Lipschitz…

Analysis of PDEs · Mathematics 2021-12-15 Piermarco Cannarsa , Anna Doubova , Masahiro Yamamoto

We investigate mutual behavior of cascades, contours of which are contained in a fixed ultrafilter. Using that relation we prove (ZFC) that the class of strict $J_{\omega^\omega}$-ultrafilters, introduced by J. E. Baumgartner in…

Logic · Mathematics 2012-01-11 Andrzej Starosolski

Prolog's ability to return multiple answers on backtracking provides an elegant mechanism to derive reversible encodings of combinatorial objects as Natural Numbers i.e. {\em ranking} and {\em unranking} functions. Starting from a…

Logic in Computer Science · Computer Science 2008-08-06 Paul Tarau

Repetition avoidance has been studied since Thue's work. In this paper, we considered another type of repetition, which is called pseudo-power. This concept is inspired by Watson-Crick complementarity in DNA sequence and is defined over an…

Formal Languages and Automata Theory · Computer Science 2009-11-13 Ehsan Chiniforooshan , Lila Kari , Zhi Xu
‹ Prev 1 8 9 10 Next ›