English
Related papers

Related papers: A short note on model theory of C((t))

200 papers

We prove a compact $T(1)$ theorem, involving quantitative estimates, analogous to the quantitative classical $T(1)$ theorem due to Stein. We also discuss the $C_c^\infty$-to-$CMO$ mapping properties of non-compact Calder\'on-Zygmund…

Functional Analysis · Mathematics 2025-03-18 Árpád Bényi , Guopeng Li , Tadahiro Oh , Rodolfo H. Torres

We prove that the class of all ordinals Ord is not weakly compact with respect to definable classes. Specifically, in any model of ZFC, the definable tree property fails for Ord, in that there is a definable Ord tree with no definable…

Logic · Mathematics 2017-10-27 Ali Enayat , Joel David Hamkins

Any superrosy division ring (i.e. a division ring equipped with an abstract notion of rank) is shown to be centrally finite. Furthermore, division rings satisfying a generalized chain condition on definable subgroups are studied. In…

Logic · Mathematics 2016-05-16 Nadja Hempel , Daniel Palacín

In this paper we explore the structure and properties of C-groups. We define a C-group as a group $G$ with $rk(G) < rk(Z(G))$ (where $rk(G)$ is the minimal cardinal of a generating set for a group $G$). Using GAP (a group theory program)…

Group Theory · Mathematics 2007-05-23 Mihai Tohaneanu , Margarethe Flanders , Avi Silterra

Classification is an important goal in many branches of mathematics. The idea is to describe the members of some class of mathematical objects, up to isomorphism or other important equivalence in terms of relatively simple invariants. Where…

Logic · Mathematics 2008-03-25 Wesley Calvert , Julia F. Knight

We prove some technical results on definable types in $p$-adically closed fields, with consequences for definable groups and definable topological spaces. First, the code of a definable $n$-type (in the field sort) can be taken to be a real…

Logic · Mathematics 2024-07-18 Pablo Andujar Guerrero , Will Johnson

P-E. Caprace and N. Monod isolate the class $\mathscr{X}$ of locally compact groups for which relatively amenable closed subgroups are amenable. It is unknown if $\mathscr{X}$ is closed under group extension. In this note, we exhibit a…

Group Theory · Mathematics 2016-03-07 Phillip Wesolek

Given a henselian valuation, we study its definability (with and without parameters) by examining conditions on the value group. We show that any henselian valuation whose value group is not closed in its divisible hull is definable in the…

Logic · Mathematics 2022-06-16 Lothar Sebastian Krapp , Salma Kuhlmann , Moritz Link

A classification theorem is obtained for a class of unital simple separable amenable Z-stable C*-algebras which exhausts all possible values of the Elliott invariant for unital stably finite simple separable amenable Z-stable C*-algebras.…

Operator Algebras · Mathematics 2021-05-05 Guihua Gong , Huaxin Lin , Z. Niu

We consider some questions about formal languages that arise when inverses of letters, words and languages are defined. The reduced representation of a language over the free monoid is its unique equivalent representation in the free group.…

Formal Languages and Automata Theory · Computer Science 2009-10-26 Thomas Ang , Giovanni Pighizzini , Narad Rampersad , Jeffrey Shallit

We consider an action of a countable amenable group on a compact metric space, focusing on the set of generic points with respect to a fixed F{\o}lner sequence. For a given characteristic class, we prove that the set of points that are…

Dynamical Systems · Mathematics 2025-10-31 Sejal Babel , Martha Łącka , Marcel Mroczek

The structures $\langle M,\subseteq^M\rangle$ arising as the inclusion relation of a countable model of sufficient set theory $\langle M,\in^M\rangle$, whether well-founded or not, are all isomorphic. These structures $\langle…

Logic · Mathematics 2017-04-17 Joel David Hamkins , Makoto Kikuchi

We introduce a notion of compatibility between constraint encoding and compositional structure. Phrased in the language of category theory, it is given by a "composable constraint encoding". We show that every composable constraint encoding…

Category Theory · Mathematics 2021-12-14 Matt Wilson , Augustin Vanrietvelde

Given an o-minimal structure ${\mathcal M}$ with a group operation, we show that for a properly convex subset $U$, the theory of the expanded structure ${\mathcal M}'=({\mathcal M},U)$ has definable Skolem functions precisely when…

Logic · Mathematics 2016-11-17 Michael C. Laskowski , Christopher S. Shaw

We give a new definition of the so-called overgenerated rings, which are the usual tool used to define the asymptotic structure of a (C,E,P)-algebra, written as a factor space M_{(A,E,P)}/N_{(I_{A},E,P)}. With this new definition and in the…

Functional Analysis · Mathematics 2008-10-07 Antoine Delcroix

Finite valued constraint satisfaction problems are a formalism for describing many natural optimization problems, where constraints on the values that variables can take come with rational weights and the aim is to find an assignment of…

Logic in Computer Science · Computer Science 2015-04-15 Anuj Dawar , Pengming Wang

We prove that the category of countable Tate modules over an arbitrary discrete ring embeds fully faithfully into that of condensed modules. If the base ring is of finite type, we characterize the essential image as generated by the free…

Category Theory · Mathematics 2025-01-23 Valerio Melani , Hugo Pourcelot , Gabriele Vezzosi

In this paper natural necessary and sufficient conditions for quantifier elimination of matrix rings $M_n(K)$ in the language of rings expanded by two unary functions, naming the trace and transposition, are identified. This is used…

Logic · Mathematics 2025-03-31 Igor Klep , Marcus Tressl

In this document we achieve exact and asymptotic enumeration of words, compositions over a finite group, and/or integer compositions characterized by local restrictions and, separately, subsequence pattern avoidance. We also count…

Combinatorics · Mathematics 2019-04-19 Andrew MacFie

We construct words with small image in a given finite alternating or unimodular group. This shows that word width in these groups is unbounded in general.

Group Theory · Mathematics 2012-05-10 Martin Kassabov , Nikolay Nikolov
‹ Prev 1 3 4 5 6 7 10 Next ›