Related papers: A note on first-order spectra with binary relation…
We completely determine the spectrum of an $I$-graph, that is, the eigenvalues of its adjacency matrix. We apply our result to prove known characterizations of connectedness and bipartiteness in $I$-graphs by using an spectral approach.…
A binary string representation of prime occurrences is a sequence of bits, where $1$ entries encode positions of prime numbers. This is a convenient representation for analysis of prime distribution, since it allows for application of a…
The finite models of a universal sentence $\Phi$ in a finite relational signature are the age of a structure if and only if $\Phi$ has the joint embedding property. We prove that the computational problem whether a given universal sentence…
For many standard models of random structure, first-order logic sentences exhibit a convergence phenomenon on random inputs. The most well-known example is for random graphs with constant edge probability, where the probabilities of…
Let $G$ be a finite abelian group and $A$ a subset of $G$. The spectrum of $A$ is the set of its large Fourier coefficients. Known combinatorial results on the structure of spectrum, such as Chang's theorem, become trivial in the regime…
We introduce a class of subshifts governed by finitely many two-sided infinite words. We call these words leading sequences. We show that any locally constant cocycle over such a subshift is uniform. From this we obtain Cantor spectrum of…
It was recently shown by van den Broeck at al. that the symmetric weighted first-order model counting problem (WFOMC) for sentences of two-variable logic FO2 is in polynomial time, while it is Sharp-P_1 complete for some FO3-sentences. We…
Statistical data by their very nature are indeterminate in the sense that if one repeats the process of collecting the data the new data set will be different from the original. But two data sets generated in the same way should ``tell the…
The relation between the spectra of operator pencils with unbounded coefficients and of associated linear relations is investigated. It turns out that various types of spectrum coincide and the same is true for the Weyr characteristics.…
Program semantics can often be expressed as a (many-sorted) first-order theory S, and program properties as sentences $\varphi$ which are intended to hold in the canonical model of such a theory, which is often incomputable. Recently, we…
If $G$ is a finite group, then the spectrum $\omega(G)$ is the set of all element orders of $G$. The prime spectrum $\pi(G)$ is the set of all primes belonging to $\omega(G)$. A simple graph $\Gamma(G)$ whose vertex set is $\pi(G)$ and in…
We study the expressive power of the two-variable fragment of order-invariant first-order logic. This logic departs from first-order logic in two ways: first, formulas are only allowed to quantify over two variables. Second, formulas can…
I study definable sets in affine continuous logic. Let $T$ be an affine theory. After giving some general results, it is proved that if $T$ has a first order model, its extremal theory is a complete first order theory and first order…
Two finite groups are said to be isospectral if they have the same sets of element orders. This paper completes the description of finite groups that are isospectral to finite simple groups with disconnected prime graph.
Given a set $F$ of words, one associates to each word $w$ in $F$ an undirected graph, called its extension graph, and which describes the possible extensions of $w$ on the left and on the right. We investigate the family of sets of words…
The notion of spectrum of first-order properties introduced by J. Spencer for Erdos-Renyi random graph is considered in relation to random uniform hypergraphs. We study properties of spectrum for first-order formulae with bounded quantifier…
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…
Kleene algebra axioms are complete with respect to both language models and binary relation models. In particular, two regular expressions recognise the same language if and only if they are universally equivalent in the model of binary…
In this paper, we examine an analogue of the recently solved spectrum conjecture by Fujita in the setting of Fine polyhedral adjunction theory. We present computational results for lower-dimensional polytopes, which lead to a complete…
The observable spectrum of an unresolved binary star system is a superposition of two single-star spectra. Even without a detectable velocity offset between the two stellar components, the combined spectrum of a binary system is in general…