English
Related papers

Related papers: Pseudofiniteness in Hrushovski Constructions

200 papers

We study definable sets $D$ of SU-rank 1 in $M^{eq}$, where $M$ is a countable homogeneous and simple structure in a language with finite relational vocabulary. Each such $D$ can be seen as a `canonically embedded structure', which inherits…

Logic · Mathematics 2015-03-10 Ove Ahlman , Vera Koponen

For any Legendrian knot or link in $\mathbb{R}^3$, we construct an $L_\infty$ algebra that can be viewed as an extension of the Chekanov-Eliashberg differential graded algebra. The $L_\infty$ structure incorporates information from rational…

Symplectic Geometry · Mathematics 2025-07-21 Lenhard Ng

Suppose, $G$ is a residually finite group of finite upper rank admitting an automorphism $\varphi$ with finite Reidemeister number $R(\varphi)$ (the number of $\varphi$-twisted conjugacy classes). We prove that such $G$ is soluble-by-finite…

Group Theory · Mathematics 2022-10-04 Evgenij Troitsky

Let $\Lambda$ be the limit set of a conformal dynamical system, i.e. a Kleinian group acting on either finite- or infinite-dimensional real Hilbert space, a conformal iterated function system, or a rational function. We give an easily…

Dynamical Systems · Mathematics 2018-11-22 Tushar Das , David Simmons , Mariusz Urbański

Rhetorical Structure Theory implies no single discourse interpretation of a text, and the limitations of RST parsers further exacerbate inconsistent parsing of similar structures. Therefore, it is important to take into account that the…

Computation and Language · Computer Science 2024-01-23 Elena Chistova

We generalize the familiar notion of periodicity in sequences to a new kind of pseudoperiodicity, and we prove some basic results about it. We revisit the results of a 2012 paper of Shevelev and reprove his results in a simpler and more…

Combinatorics · Mathematics 2024-02-14 Joseph Meleshko , Pascal Ochem , Jeffrey Shallit , Sonja Linghui Shan

The (prefix-free) Kolmogorov complexity of a finite binary string is the length of the shortest description of the string. This gives rise to some `standard' lowness notions for reals: A is K-trivial if its initial segments have the lowest…

Logic · Mathematics 2014-10-15 Ian Herbert

Let $R_1$ be a commutative ring, let $R_2$ be a finitely generated extension ring of $R_1$, and let $S$ be a ring that is intermediate between $R_1$ and $R_2$. For $R_1 = R[x]$ and $R_2 = R[x,y]$, this paper gives simple combinatorial…

Commutative Algebra · Mathematics 2020-04-17 Melvyn B. Nathanson

If $L$ is a relational language, then an $L$-structure ${\mathbb X}=\langle X,\bar \rho \rangle$ is reversible iff there is no interpretation $\bar \sigma \varsubsetneq \bar \rho$ such that the structures $\langle X,\bar \sigma \rangle$ and…

Logic · Mathematics 2023-06-27 Miloš S. Kurilić

Let $\bar{L}_i\lr X_i$ be a holomorphic line bundle over a compact complex manifold for $i=1,2$. Let $S_i$ denote the associated principal circle-bundle with respect to some hermitian inner product on $\bar{L}_i$. We construct complex…

Complex Variables · Mathematics 2014-03-10 Parameswaran Sankaran , Ajay Singh Thakur

We introduce PHFL, a probabilistic extension of higher-order fixpoint logic, which can also be regarded as a higher-order extension of probabilistic temporal logics such as PCTL and the $\mu^p$-calculus. We show that PHFL is strictly more…

Logic in Computer Science · Computer Science 2023-06-22 Yo Mitani , Naoki Kobayashi , Takeshi Tsukada

Let $R$ be a discrete valuation ring, with valuation $v \colon R \twoheadrightarrow \mathbb{Z}_{\ge 0} \cup \{\infty\}$ and residue field $k$. Let $H$ be a hypersurface $\operatorname{Proj}(R[x_0,\ldots,x_n]/\langle f \rangle)$. Let $H_k$…

Algebraic Geometry · Mathematics 2025-10-17 Bjorn Poonen , Michael Stoll

In this paper we prove that the vertex algebra $V_L^+$ is rational if $L$ is a negative definite even lattice of finite rank, or if $L$ is a non-degenerate even lattice of a finite rank that is neither positive definite nor negative…

Quantum Algebra · Mathematics 2008-07-25 Gaywalee Yamskulna

In this paper we address the decision problem for a fragment of set theory with restricted quantification which extends the language studied in [4] with pair related quantifiers and constructs, in view of possible applications in the field…

Logic in Computer Science · Computer Science 2012-10-10 Domenico Cantone , Cristiano Longo

Let H be a Hilbert space and let F be the family of all countable subsets of an orthonormal basis of H. We show that if F is infinite then F is equipollent with every linear basis of the vector space H. In doing so we also present a short…

General Mathematics · Mathematics 2020-10-06 Gerald Kuba

Schurian-finiteness, also known as $\tau$-tilting finiteness, is equivalent to the finiteness of various representation theoretic objects such as wide subcategories. The first three authors classified Schurian-finite blocks of type A Hecke…

Representation Theory · Mathematics 2025-12-23 Susumu Ariki , Sinéad Lyle , Liron Speyer , Qi Wang

We analyse the pseudofinite monadic second order theory of words over a fixed finite alphabet. In particular we present an axiomatisation of this theory, working in a one-sorted first order framework. The analysis hinges on the fact that…

Logic · Mathematics 2022-03-14 Deacon Linkhorn

We generalize the lexicographic product of first-order structures by presenting a framework for constructions which, in a sense, mimic iterating the lexicographic product infinitely and not necessarily countably many times. We then define…

Logic · Mathematics 2023-08-09 Nadav Meir

In this paper we study the geometry of certain functionals associated to quasilinear elliptic boundary value problems with a degenerate nonlocal term of Kirchhoff type. Due to the degeneration of the nonlocal term it is not possible to…

Analysis of PDEs · Mathematics 2020-04-21 Leonelo Iturriaga , Eugenio Massa

Functors with an instance of the Traversable type class can be thought of as data structures which permit a traversal of their elements. This has been made precise by the correspondence between traversable functors and finitary containers…

Logic in Computer Science · Computer Science 2022-07-21 Gershom Bazerman