Related papers: Comparing Classes of Finite Structures
The rank of a graph is defined to be the rank of its adjacency matrix. A graph is called reduced if it has no isolated vertices and no two vertices with the same set of neighbors. A reduced graph $G$ is said to be maximal if any reduced…
We propose an approach to learning with graph-structured data in the problem domain of graph classification. In particular, we present a novel type of readout operation to aggregate node features into a graph-level representation. To this…
We investigate the theory of finite observables, i.e., resolutions of the finite-dimensional identity by means of positive operators, that have a physical interpretation in terms of measurement schemes. We focus on extremal and rank-one…
We investigate families of graphs and graphons (graph limits) that are defined by a finite number of prescribed subgraph densities. Our main focus is the case when the family contains only one element, i.e., a unique structure is forced by…
We classify, up to isomorphism and up to equivalence, division gradings (by abelian groups) on finite-dimensional simple real algebras. Gradings on finite-dimensional simple algebras are determined by division gradings, so our results give…
We show that if A is a linear order then Th(A) is either $\aleph_0$-categorical or Borel complete (in the sense of Friedman and Stanley). We generalize this; if A has countably many unary predicates attached, then Th(A) is…
We introduce the Insertion Chain Complex, a higher-dimensional extension of insertion graphs, as a new framework for analyzing finite sets of words. We study its topological and combinatorial properties, in particular its homology groups,…
In this paper we give an algorithm to determine, for any given suborder closed class of series-parallel posets, a structure theorem for the class. We refer to these structure theorems as structural descriptions.
In this paper, we consider various graphs, namely: power graph, cyclic graph, enhanced power graph and commuting graph, on a finite semigroup $S$. For an arbitrary pair of these four graphs, we classify finite semigroups such that the…
We refine and advance the study of the local structure of idempotent finite algebras started in [A.Bulatov, The Graph of a Relational Structure and Constraint Satisfaction Problems, LICS, 2004]. We introduce a graph-like structure on an…
Various feature descriptions are being employed in logic programming languages and constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called features. The descriptions…
This paper introduces a class of objects called decision rules that map infinite sequences of alternatives to a decision space. These objects can be used to model situations where a decision maker encounters alternatives in a sequence such…
Classical algebraic structures require exact satisfaction of their defining axioms. We propose similarity algebra, a framework extending algebraic and Lie structures to settings where operations satisfy quantitative bounds up to a tolerance…
We reduce the classification of finite extensions of function fields (of curves over finite fields) with the same class number to a finite computation; complete this computation in all cases except when both curves have base field…
Given a holonomic sequence $F(n)$, we characterize rational functions $r(n)$ so that $r(n)F(n)$ can be summable. We provide upper and lower bounds on the degree of the numerator of $r(k)$ and show the denominator of $r(n)$ can be read from…
We define a natural class of graphs by generalizing prior notions of visibility, allowing the representing regions and sightlines to be arbitrary. We consider mainly the case of compact connected representing regions, proving two results…
The theory of finitely supported algebraic structures is related to Pitts theory of nominal sets (by equipping finitely supported sets with finitely supported internal algebraic laws). It represents a reformulation of Zermelo Fraenkel set…
We study the local isomorphism classes, also known as genera or weak equivalence classes, of fractional ideals of orders in \'etale algebras. We provide a classification in terms of linear algebra objects over residue fields. As a…
We define a family of three related reducibilities, $\leq_T$, $\leq_{tt}$ and $\leq_m$, for arbitrary functions $f,g:X\rightarrow\mathbb R$, where $X$ is a compact separable metric space. The $\equiv_T$-equivalence classes mostly coincide…
The nullity of a graph is the multiplicity of the eigenvalue zero in its adjacency spectrum. In this paper, we give a closed formula for the minimum and maximum nullity among trees with the same degree sequence, using the notion of matching…