Related papers: A note on first-order spectra with binary relation…
Given a Borel class of trees, we show that there is a tree in that class whose Scott sentence is not too much more complicated than the definition of the class. In particular, if the class is definable by a $\Pi_\alpha$ sentence, then there…
For any graph $G$, the First-Fit (or Grundy) chromatic number of $G$, denoted by $\chi_{_{\sf FF}}(G)$, is defined as the maximum number of colors used by the First-Fit (greedy) coloring of the vertices of $G$. We call a family…
In this work the method of analyzing of the absolutely continuous spectrum for self-adjoint operators is considered. For the analysis it is used an approximation of self-adjoint operator $A$ by a sequence of operators $A_n$ with absolutely…
We investigate connections between SAT (the propositional satisfiability problem) and combinatorics, around the minimum degree (number of occurrences) of variables in various forms of redundancy-free boolean conjunctive normal forms…
Scattering equations for tree-level amplitudes are viewed in the context of string theory. As a result of the comparison we are led to define a new dual model which coincides with string theory in both the small and large $\alpha'$ limit,…
We initiate the study of a quantitative measure for the failure of a binary operation to be commutative and associative. We call this measure the associative-commutative spectrum as it extends the so-called associative spectrum (also known…
The degree of a CSP instance is the maximum number of times that any variable appears in the scopes of constraints. We consider the approximate counting problem for Boolean CSP with bounded-degree instances, for constraint languages…
Given a compact space $X$, a commutative Banach algebra $A$, and an $A$-valued function algebra $\mathscr{A}$ on $X$, the notions of vector-valued spectrum of functions $f\in\mathscr{A}$ are discussed. The $A$-valued spectrum…
In this note we extend the spectral theorem for bimodules to the higher rank graph C*-algebra context. Under the assumption that the graph is row finite and has no sources, we show that a bimodule over a natural abelian subalgebra is…
An \emph{adjacency labeling scheme} for a given class of graphs is an algorithm that for every graph $G$ from the class, assigns bit strings (labels) to vertices of $G$ so that for any two vertices $u,v$, whether $u$ and $v$ are adjacent…
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs with bounded-degree instances, for constraint languages…
We propose FC, a new logic on words that combines finite model theory with the theory of concatenation - a first-order logic that is based on word equations. Like the theory of concatenation, FC is built around word equations; in contrast…
We study first-order logic (FO) over the structure consisting of finite words over some alphabet $A$, together with the (non-contiguous) subword ordering. In terms of decidability of quantifier alternation fragments, this logic is…
We place ourselves in the setting of high-dimensional statistical inference where the number of variables $p$ in a dataset of interest is of the same order of magnitude as the number of observations $n$. We consider the spectrum of certain…
Patterns are words with terminals and variables. The language of a pattern is the set of words obtained by uniformly substituting all variables with words that contain only terminals. In their original definition, patterns only allow for…
Form Factor Perturbation Theory is applied to study the spectrum of the O(3) non--linear sigma model with the topological term in the vicinity of $\theta = \pi$. Its effective action near this value is given by the non--integrable double…
We characterize possible spectra of rank-one perturbations B of a self-adjoint operator A with discrete spectrum and, in particular, prove that the spectrum of B may include any number of real or non-real eigenvalues of arbitrary algebraic…
We say that a first order formula A distinguishes a graph G from another graph G' if A is true on G and false on G'. Provided G and G' are non-isomorphic, let D(G,G') denote the minimal quantifier rank of a such formula. We prove that, if G…
We discuss spectral correlations in coarse-grained chaotic two-dimensional CFTs with large central charge. We study a partition function describing the dense part of the spectrum of primary states in a way that disentangles the chaotic…
We consider the relationship between derivations $d$ and $g$ of a Banach algebra $B$ that satisfy $\s(g(x)) \subseteq \s(d(x))$ for every $x\in B$, where $\s(\, . \,)$ stands for the spectrum. It turns out that in some basic situations, say…