Related papers: Fifty Years of the Spectrum Problem: Survey and Ne…
The finite spectrum of a first-order sentence is the set of positive integers that are the sizes of its models. The class of finite spectra is known to be the same as the complexity class NE. We consider the spectra obtained by limiting…
We connect and solve two longstanding open problems in quite different areas: the model-theoretic question of whether $SOP_2$ is maximal in Keisler's order, and the question from set theory/general topology of whether $\mathfrak{p} =…
The spectrum of a first-order sentence is the set of the cardinalities of its finite models. In this paper, we consider the spectra of sentences over binary relations that use at least three variables. We show that for every such sentence…
Recent works have explored the use of counting queries coupled with Description Logic ontologies. The answer to such a query in a model of a knowledge base is either an integer or $\infty$, and its spectrum is the set of its answers over…
Matthew de Brecht raised the question of whether countable frames are continuous lattices. We prove that the continuity of a countable frame implies the quasicontinuity of its corresponding spectrum in the dual specialization order. We…
The {\em spectrum} of a first-order logic sentence is the set of natural numbers that are cardinalities of its finite models. In this paper we show that when restricted to using only two variables, but allowing counting quantifiers, the…
The spectrum of a first-order logic sentence is the set of natural numbers that are cardinalities of its finite models. In this paper we study the hierarchy of first-order spectra based on the number of variables. It has been conjectured…
This paper discusses the history of Fraunhofer's puzzling discovery of the fixed lines in various spectra (most notably of the sun) and the implications of these spectral "imperfections". Moreover, the developments in spectroscopy by…
In this opening talk I first describe how we are entering a data-rich era, and what clues we might soon have to physics beyond the SM (on a time scale of several years). Then we turn to a number of the basic issues we hope to explain, and…
The categoricity spectrum of a class of structures is the collection of cardinals in which the class has a single model up to isomorphism. Assuming that cardinal exponentiation is injective (a weakening of the generalized continuum…
The problem of computing spectra of operators is arguably one of the most investigated areas of computational mathematics. However, the problem of computing spectra of general bounded infinite matrices has only recently been solved. We…
In 1960s, Dana Scott gave a recursion theoretic characterization of standard systems of countable non-standard models of arithmetic, i.e., collections of sets of standard natural numbers coded in non-standard models. Later, Knight and Nadel…
Complex networks or graphs are ubiquitous in sciences and engineering: biological networks, brain networks, transportation networks, social networks, and the World Wide Web, to name a few. Spectral graph theory provides a set of useful…
In this survey paper we review classical results and recent progress about a certain topic in the spectral theory of two-dimensional canonical systems. Namely, we consider the questions whether the spectrum $\sigma$ is discrete, and if it…
In this paper, we consider real and complex algebras as well as algebras over general fields. In Section 2, we revisit and prove several results on (quadratic) algebras over general fields. As an example, we demonstrate that a quadratic…
We introduce the asymptotic spectrum of graphs and apply the theory of asymptotic spectra of Strassen (J. Reine Angew. Math. 1988) to obtain a new dual characterisation of the Shannon capacity of graphs. Elements in the asymptotic spectrum…
It has been noticed since around 2007 that certain enumeration problems can be solved when an analytic or algebraic curve is identified. This curve is the key to the problem. In these lectures, a few such examples are presented. One is a…
Regular sequences are natural generalisations of fixed points of constant-length substitutions on finite alphabets, that is, of automatic sequences. Using the harmonic analysis of measures associated with substitutions as motivation, we…
Toen has interpreted the schematization problem as originally imagined by Grothendieck in "Pursuing Stacks" in such a way that solution(s) to this problem could be given. As he pointed out, there are many solutions available, and he gave…
Given a semiring with a preorder subject to certain conditions, the asymptotic spectrum, as introduced by Strassen (J. reine angew. Math. 1988), is a compact Hausdorff space together with a map from the semiring to the ring of continuous…