English
Related papers

Related papers: Bounds on Continuous Scott Rank

200 papers

Let $(u,p)$ solve the incompressible Navier--Stokes equations in a regime in which an energy inequality is available and each constant in that inequality is computable from declared data. We construct a reduced-order model $u_n$ constrained…

Numerical Analysis · Mathematics 2026-02-18 Chandrasekhar Gokavarapu , Naveen Kumar Kakumanu , Anjali Datla , Githa Harshitha Noolu

The goal of the paper is to introduce a version of Schubert calculus for each dihedral reflection group W. That is, to each "sufficiently rich'' spherical building Y of type W we associate a certain cohomology theory and verify that, first,…

Group Theory · Mathematics 2010-08-11 Arkady Berenstein , Michael Kapovich

Following the paper~[3] by V\"{a}\"{a}n\"{a}nen and the author, we continue to investigate on the difference between Boolean-valued second-order logic and full second-order logic. We show that the compactness number of Boolean-valued…

Logic · Mathematics 2025-04-18 Daisuke Ikegami

We observe that a recent theorem of Sato, Toms-White-Winter and Kirchberg-Rordam also holds for certain nonunital C*-algebras. Namely, we show that an algebraically simple, separable, nuclear, nonelementary C*-algebra with strict…

Operator Algebras · Mathematics 2013-07-04 Bhishan Jacelon

This work investigates the structure of rank-metric codes in connection with concepts from finite geometry, most notably the $q$-analogues of projective systems and blocking sets. We also illustrate how to associate a classical…

Combinatorics · Mathematics 2021-06-24 Gianira N. Alfarano , Martino Borello , Alessandro Neri , Alberto Ravagnani

We give Scott sentences for certain computable groups, and we use index set calculations as a way of checking that our Scott sentences are as simple as possible. We consider finitely generated groups and torsion-free abelian groups of…

Logic · Mathematics 2017-07-10 Julia Knight , Vikram Saraph

In this paper, we give a topological version of Scott convergence theorem for locally hypercompact spaces. We introduce the notion of $\mathcal{S}^*_X$-convergence on a $T_0$ topological space $X$, and define the notion of finitely…

General Topology · Mathematics 2023-08-09 Yuxu Chen , Hui Kou

Given an idempotent complete additive category, we show the there is an explicitly constructed topological space such that the lattice of exact substructures is anti-isomorphic to the lattice of closed subsets. In the special case that the…

Representation Theory · Mathematics 2026-02-02 Julia Sauter

For a metric compact space $L$ and a Banach space $E$, we provide a characterization of the complementability of the Banach space $\mathcal{C}(L)$ of continuous functions on $L$ inside $E$ in terms of the existence of a certain tree in the…

Functional Analysis · Mathematics 2026-03-16 Jakub Rondoš , Damian Sobota

Motivated by the structure of certain modules over the loop Virasoro Lie conformal algebra and the Lie structures of Schrodinger-Virasoro algebras, we construct a class of infinite rank Lie conformal algebras CSV (a, b), where a, b are…

Rings and Algebras · Mathematics 2016-09-21 Guangzhe Fan , Yucai Su , Chunguang Xia

Nash or Sobolev inequalities are known to be equivalent to ultracontractive properties of Markov semigroups, hence to uniform bounds on their kernel densities. In this work we present a simple and extremely general method, based on weighted…

Probability · Mathematics 2013-09-19 Dominique Bakry , François Bolley , Ivan Gentil , Patrick Maheux

Function-Correcting Codes (FCCs) are a novel class of codes designed to protect function evaluations of messages against errors while minimizing redundancy. A theoretical framework for systematic FCCs to channels matched to the Lee metric…

Information Theory · Computer Science 2026-04-29 Hareesh K. , Rashid Ummer N. T. , B. Sundar Rajan

A fundamental result from Boolean modal logic states that a first-order definable class of Kripke frames defines a logic that is validated by all of its canonical frames. We generalise this to the level of non-distributive logics that have…

Logic · Mathematics 2020-02-11 Robert Goldblatt

We establish the decidability of the $\Sigma_2$ theory of $\mathscr{D}_h(\leq_h \mathcal{O})$, the hyperarithmetic degrees below Kleene's $\mathcal{O}$, in the language of uppersemilattices with least and greatest element. This requires a…

Logic · Mathematics 2017-04-24 James Barnes

Synchronous Kleene algebra (SKA), an extension of Kleene algebra (KA), was proposed by Prisacariu as a tool for reasoning about programs that may execute synchronously, i.e., in lock-step. We provide a countermodel witnessing that the…

Logic in Computer Science · Computer Science 2023-02-03 Jana Wagemaker , Marcello Bonsangue , Tobias Kappé , Jurriaan Rot , Alexandra Silva

For a signature L with at least one constant symbol, an L-structure is called minimal if it has no proper substructures. Let S_L be the set of isomorphism types of minimal L-structures. The elements of S_L can be identified with…

Logic · Mathematics 2013-03-05 Oleg Belegradek

The problem of analyzing the number of number field extensions $L/K$ with bounded (relative) discriminant has been the subject of renewed interest in recent years, with significant advances made by Schmidt, Ellenberg-Venkatesh, Bhargava,…

Number Theory · Mathematics 2017-04-18 Evan P. Dummit

In this paper we study a notion of HL-extension (HL standing for Herwig--Lascar) for a structure in a finite relational language $\mathcal{L}$. We give a description of all finite minimal HL-extensions of a given finite…

Logic · Mathematics 2020-07-22 Mahmood Etedadialiabadi , Su Gao

The complexity class $\exists\mathbb R$, standing for the complexity of deciding the existential first order theory of the reals as real closed field in the Turing model, has raised considerable interest in recent years. It is well known…

Computational Complexity · Computer Science 2025-02-04 Klaus Meer , Adrian Wurm

Although upper bound guarantees for bilevel optimization have been widely studied, progress on lower bounds has been limited due to the complexity of the bilevel structure. In this work, we focus on the smooth nonconvex-strongly-convex…

Machine Learning · Computer Science 2025-11-27 Kaiyi Ji