Related papers: Hereditary classes of ordered binary structures

We develop a general framework (multidimensional asymptotic classes, or m.a.c.s) for handling classes of finite first order structures with a strong uniformity condition on cardinalities of definable sets: The condition asserts that…

A computation shows that there are 77 (up to scalar shifts) possible pairs of integer coefficient polynomials of degree five, having roots of unity as their roots, and satisfying the conditions of Beukers and Heckman [1], so that the…

It has long been known that the following basic objects are obstructions to bounded tree-width: for arbitrarily large $t$, $(1)$ the complete graph $K_t$, $(2)$ the complete bipartite graph $K_{t,t}$, $(3)$ a subdivision of the $(t \times…

In the context of reconstructing phylogenetic networks from a collection of phylogenetic trees, several characterisations and subsequently algorithms have been established to reconstruct a phylogenetic network that collectively embeds all…

We show that a $C^*$-algebra $\mathfrak{A}$ which is stably isomorphic to a unital graph $C^*$-algebra, is isomorphic to a graph $C^*$-algebra if and only if it admits an approximate unit of projections. As a consequence, a hereditary…

For a braided finite tensor category $\mathcal{C}$ with unit object $1 \in \mathcal{C}$, Lyubashenko considered a certain Hopf algebra $\mathbb{F} \in \mathcal{C}$ endowed with a Hopf pairing $\omega: \mathbb{F} \otimes \mathbb{F} \to 1$ to…

Let $f : X \to S$ be a smooth projective family defined over $\mathcal{O}_{K}[\mathcal{S}^{-1}]$, where $K \subset \mathbb{C}$ is a number field and $\mathcal{S}$ is a finite set of primes. For each prime $\mathfrak{p} \in…

We prove that finding a rooted subtree with at least $k$ leaves in a digraph is a fixed parameter tractable problem. A similar result holds for finding rooted spanning trees with many leaves in digraphs from a wide family $\cal L$ that…

We introduce a family of graphs, which we call down-left graphs, and study their combinatorial and algebraic properties. We show that members of this family are well-covered, $C_5$-free, and vertex decomposable. By applying a result of…

We study endomorphism algebras of 2-term silting complexes in derived categories of hereditary finite dimensional algebras, or more generally of $\mathop{\rm Ext}\nolimits$-finite hereditary abelian categories. Module categories of such…

An $h$-ary relation $\r$ on a finite set $A$ is said to be \emph{hereditarily rigid} if the unary partial functions on $A$ that preserve $\r$ are the subfunctions of the identity map or of constant maps. A family of relations ${\mathcal F}$…

In this paper we study complexity of an extension of ordered binary decision diagrams (OBDDs) called $c$-OBDDs on CNFs of bounded (primal graph) treewidth. In particular, we show that for each $k$ there is a class of CNFs of treewidth $k…

The domination polynomial of a graph $G$ is given by $D(G,x)=\sum_{k=0}^{n} d_k(G)x^k$ where $d_k(G)$ records the number of $k$-element dominating sets in $G$. A conjecture of Alikhani and Peng asserts that these polynomials have unimodal…

Inspired by a width invariant on permutations defined by Guillemot and Marx, Bonnet, Kim, Thomass\'e, and Watrigant introduced the twin-width of graphs, which is a parameter describing its structural complexity. This invariant has been…

We study weakly symmetric special biserial algebras of infinite representation type. We show that usually some socle deformation of such an algebra has non-periodic bounded modules. The exceptions are precisely the algebras whose Brauer…

Balogh, Bollobas and Weinreich showed that a parameter that has since been termed the distinguishing number can be used to identify a jump in the possible speeds of hereditary classes of graphs at the sequence of Bell numbers. We prove that…

Since counting subgraphs in general graphs is, by and large, a computationally demanding problem, it is natural to try and design fast algorithms for restricted families of graphs. One such family that has been extensively studied is that…

Let $\Lambda$ be a finite dimensional algebra and $G$ be a finite group whose elements act on $\Lambda$ as algebra automorphisms. Under the assumption that $\Lambda$ has a complete set $E$ of primitive orthogonal idempotents, closed under…

We introduce parabolic degenerations of rational Cherednik algebras of complex reflection groups, and use them to give necessary conditions for finite-dimensionality of an irreducible lowest weight module for the rational Cherednik algebra…

The multicorns are the connectedness loci of unicritical antiholomorphic polynomials $\bar{z}^d + c$. We investigate the structure of boundaries of hyperbolic components: we prove that the structure of bifurcations from hyperbolic…