Related papers: Bounds on Continuous Scott Rank

We extend the notions of Dedekind complete and sigma-Dedekind complete Banach lattices to Banach C(K)-modules. As our main result we prove for these modules an analogue of Lozanovsky's well known characterization of Banach lattices with…

We construct a complete lattice $Z$ such that the binary supremum function $\sup:Z\times Z\to Z$ is discontinuous with respect to the product topology on $Z\times Z$ of the Scott topologies on each copy of $Z$. In addition, we show that…

Counters that hold natural numbers are ubiquitous in modeling and verifying software systems; for example, they model dynamic creation and use of resources in concurrent programs. Unfortunately, such discrete counters often lead to…

The rank of a finite algebraic structure with a single binary operation is the minimum number of elements needed to express every other element under the closure of the operation. In the case of groups, the previous best algorithm for…

Given a protocol ${\cal P}$ that implements multipartite quantum channel ${\cal E}$ by repeated rounds of local operations and classical communication (LOCC), we construct an alternate LOCC protocol for ${\cal E}$ in no more rounds than…

We introduce a new technique to construct rank-metric codes using the arithmetic theory of Drinfeld modules over global fields, and Dirichlet Theorem on polynomial arithmetic progressions. Using our methods, we obtain a new infinite family…

We introduce a framework that allows for the construction of sequent systems for expressive description logics extending ALC. Our framework not only covers a wide array of common description logics, but also allows for sequent systems to be…

Let $\mathcal{L}$ be a first-order two-sorted language. Let $S$ be some fixed structure. A standard structure is an $\mathcal{L}$-structure of the form $(M,S)$, where $M$ is arbitrary. When $S$ is a compact topological space (and…

The general theory developed by Ben Yaacov for metric structures provides Fra\"iss\'e limits which are approximately ultrahomogeneous. We show here that this result can be strengthened in the case of relational metric structures. We give an…

We construct a family of functions suitable for establishing lower bounds on the oracle complexity of first-order minimization of smooth strongly-convex functions. Based on this construction, we derive new lower bounds on the complexity of…

We prove that for every odd $q\geq 3$, any $q$-query binary, possibly non-linear locally decodable code ($q$-LDC) $E:\{\pm1\}^k \rightarrow \{\pm1\}^n$ must satisfy $k \leq \tilde{O}(n^{1-2/q})$. For even $q$, this bound was established in…

We study an extension of first-order logic that allows to express cardinality conditions in a similar way as SQL's COUNT operator. The corresponding logic FOC(P) was introduced by Kuske and Schweikardt (LICS'17), who showed that query…

The compact fourth-order finite-difference scheme for solving the 1d wave equation is studied. New error bounds of the fractional order $\mathcal{O}(h^{4(\lambda-1)/5})$ are proved in the mesh energy norm in terms of data, for two initial…

Shannon gave a lower bound in 1959 on the binary rate of spherical codes of given minimum Euclidean distance $\rho$. Using nonconstructive codes over a finite alphabet, we give a lower bound that is weaker but very close for small values of…

We prove a rank-finiteness conjecture for modular categories: up to equivalence, there are only finitely many modular categories of any fixed rank. Our technical advance is a generalization of the Cauchy theorem in group theory to the…

Korn's inequalities show that the $L^2$-norm of $\nabla u$ can be controlled by the $L^2$-norm of $\mathrm{Sym}(\nabla u)$, which only has $d(d+1)/2$ components. In [J. Math. Pures Appl. 148 (2021), pp. 199-220] Chipot posed the question of…

Recently, J. D. Lawson encouraged the domain theory community to consider the scientific program of developing domain theory in the wider context of $T_0$ spaces instead of restricting to posets. In this paper, we respond to this calling…

Given a compact Lie group $G$ and its unitary dual $\widehat{G}$, we establish the weak (1,1) continuity for pseudo-differential operators in the global H\"ormander classes of order $-n(1-\rho)/2$ on $G\times \widehat{G}$. Our approach…

It is a celebrated result of McKinsey and Tarski [28] that S4 is the logic of the closure algebra X+ over any dense-in-itself separable metrizable space. In particular, S4 is the logic of the closure algebra over the reals R, the rationals…

The Scott process of a relational structure $M$ is the sequence of sets of formulas given by the Scott analysis of $M$. We present axioms for the class of Scott processes of structures in a relational vocabulary $\tau$, and use them to give…