Related papers: A note on first-order spectra with binary relation…
We investigate whether it is typical for a sparse graph to be uniquely characterized by its adjacency spectrum up to isomorphism. Our first result shows that the giant component of an Erd\H{o}s-R\'enyi graph is cospectral when the average…
We established two-sided Curto-Herrero conjecture for pairs of matrices, where the first matrix has a simple spectrum. Namely, it is shown that these pairs are separated by ranks of non-commutative polynomials in matrices. Moreover, we…
We prove that every triconnected planar graph is definable by a first order sentence that uses at most 15 variables and has quantifier depth at most $11\log_2 n+43$. As a consequence, a canonic form of such graphs is computable in $AC^1$ by…
We study links between first-order formulas and arbitrary properties for families of theories, classes of structures and their isomorphism types. Possibilities for ranks and degrees for formulas and theories with respect to given properties…
We show that the character spectrum $Sp_\chi(\lambda)$, for a singular cardinal $\lambda$ of countable cofinality, may include any prescribed set of regular cardinals between $\lambda$ and $2^\lambda$.
The logic of Dependence and Independence Bunched Implications (DIBI) is a logic to reason about conditional independence (CI); for instance, DIBI formulas can characterise CI in probability distributions and relational databases, using the…
We study the ODE/IM correspondence for ODE associated to $\hat{\mathfrak g}$-valued connections, for a simply-laced Lie algebra $\mathfrak g$. We prove that subdominant solutions to the ODE defined in different fundamental representations…
A graph $G$ is said to be \emph{determined by its spectrum} if any graph having the same spectrum as $G$ is isomorphic to $G$. Let $K_n \setminus P_{\ell}$ be the graph obtained from $K_n$ by removing edges of $P_\ell$, where $P_\ell$ is a…
Given a random text over a finite alphabet, we study the frequencies at which fixed-length words occur as subsequences. As the data size grows, the joint distribution of word counts exhibits a rich asymptotic structure. We investigate all…
We consider the tree-level amplitude, describing all 3 channels of the binary (pi ,K)-reaction, as a meromorphic polynomially bounded function of 3 dependent complex variables. Relying systematically on the Mittag-Leffler theorem, we…
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…
Given a countable scattered linear order $L$ of Hausdorff rank $\alpha < \omega_1$ we show that it has a $d\text{-}\Sigma_{2\alpha+1}$ Scott sentence. Ash calculated the back and forth relations for all countable well-orders. From this…
Originally introduced by Kolmann and Shelah as a surrogate for saturated models, limit models have been established as natural and useful objects when studying abstract elementary classes. Shelah began the study of when (multiple notions…
Sentence ordering aims at arranging a list of sentences in the correct order. Based on the observation that sentence order at different distances may rely on different types of information, we devise a new approach based on multi-granular…
For every $q\in \mathbb N$ let $\textrm{FO}_q$ denote the class of sentences of first-order logic FO of quantifier rank at most $q$. If a graph property can be defined in $\textrm{FO}_q$, then it can be decided in time $O(n^q)$. Thus,…
We give an example of a positive element $a$ in some ordered Banach algebra $A$ such that its spectrum is equal to $\{1\}$ and it is not greater than or equal to the unit element of $A$.
In this paper, we study spectra of first order properties of Erdos-Renyi random graph. We proved that minimal quantifier depth of a formula with an infinite spectrum is either 4 or 5.
We show that the class of representable substitution algebras is characterized by a set of universal first order sentences. In addition, it is shown that a necessary and sufficient condition for a substitution algebra to be representable is…
For convex and sequential effect algebras, we study spectrality in the sense of Foulis. We show that under additional conditions (strong archimedeanity, closedness in norm and a certain monotonicity property of the sequential product), such…
In this paper using a transform defined by the translation operator we introduce the concept of spectrum of sequences that are bounded by $n^\nu$, where $\nu$ is a natural number. We apply this spectral theory to study the asymptotic…