Related papers: On the Monadic Second-Order Transduction Hierarchy

Extending the classical notion of the spreading model, the $k$-spreading models of a Banach space are introduced, for every $k\in\mathbb{N}$. The definition, which is based on the $k$-sequences and plegma families, reveals a new class of…

We describe classes of toric varieties of codimension 2 which are either minimally defined by 3 binomial equations over any algebraically closed field, or are set-theoretic complete intersections in exactly one positive characteristic.

A linkage of order k of a graph G is a subgraph with k components, each of which is a path. A linkage is vital if it spans all vertices, and no other linkage connects the same pairs of end vertices. We give a characterization of the graphs…

Using a direct algebraic approach we derive convolution identities for second order sequences, hereby distinguishing between sequences obeying the same or different recurrence relations. We also state a general convolution for Horadam…

Within the field of phylogenetics there is growing interest in measures for summarising the dissimilarity, or 'incongruence', of two or more phylogenetic trees. Many of these measures are NP-hard to compute and this has stimulated a…

We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…

We present a formalization of collections that Cornelius Castoriadis calls ``magmas'', especially the property which mainly characterizes them and distinguishes them from the usual cantorian sets. It is the property of their elements to…

We prove that there is a structure, indeed a linear ordering, whose degree spectrum is the set of all non-hyperarithmetic degrees. We also show that degree spectra can distinguish measure from category.

This dissertation is a contribution to the project of second-order set theory, which has seen a revival in recent years. The approach is to understand second-order set theory by studying the structure of models of second-order set theories.…

This paper begins by extending the notion of a combinatorial configuration of points and lines to a combinatorial configuration of points and planes that we refer to as configurations of order $2$. We then proceed to investigate a further…

Classes with bounded rankwidth are MSO-transductions of trees and classes with bounded linear rankwidth are MSO-transductions of paths. These results show a strong link between the properties of these graph classes considered from the point…

This paper defines a notion of binding trees that provide a suitable model for second-order type systems with F-bounded quantifiers and equirecursive types. It defines a notion of regular binding trees that correspond in the right way to…

Let $W_{k,n}^{i}(m)$ denote a matrix with rows and columns indexed by the $k$-subsets and $n$-subsets, respectively, of an $m$-element set. The row $S$, column $T$ entry of $W_{k,n}^{i}(m)$ is $1$ if $|S \cap T| = i$, and is $0$ otherwise.…

It is shown that each subgroup of odd index in an alternating group of degree at least 10 has all insoluble composition factors to be alternating. A classification is then given of 2-arc-transitive graphs of odd order admitting an…

We describe the representation theory of C*-crossed-products of a unital C*-algebra A by the cyclic group of order 2. We prove that there are two main types of irreducible representations for the crossed-product: those whose restriction to…

We construct tree-decompositions of graphs that distinguish all their k-blocks and tangles of order k, for any fixed integer k. We describe a family of algorithms to construct such decompositions, seeking to maximize their diversity subject…

We study the interplay between canonical heights and endomorphisms of an abelian variety $A$ over a number field $k$. In particular we show that whenever the ring of endomorphisms defined over $k$ is strictly larger than $\Z$ there will be…

A spanning tree of a graph $G$ is a connected acyclic spanning subgraph of $G$. We consider enumeration of spanning trees when $G$ is a $2$-tree, meaning that $G$ is obtained from one edge by iteratively adding a vertex whose neighborhood…

The map given by the anticanonical bundle of a Fano manifold is investigated with respect to a number of natural notions of higher order embeddings of projective manifolds. This is of importance in the understanding of higher order…

Do transformers, when trained on sequential reasoning traces, build internal models of the underlying task? And if so, does the structure of those internal representations mirror the structure of the domain? We train an 8-layer transformer…