Related papers: Hereditarily rigid relations

This paper has an expository nature. We compare the spectral properties (such as boundedness and compactness) of three families of semi-infinite matrices and point out similarities between them. The common feature of these families is that…

Happel and Seidel gave a classification of piecewise hereditary Nakayama algebras, where the relations are given by some power of the radical. Here we explore what happens for general relations. We develop techniques for showing that a…

The majorization relation orders the degree sequences of simple graphs into posets called dominance orders. As shown by Ruch and Gutman (1979) and Merris (2002), the degree sequences of threshold and split graphs form upward-closed sets…

We investigate the algebraic genericity of various families of continuous functions exhibiting extreme irregularity, focusing on fractal dimensions, H\"older regularity, and fractional differentiability. Our first main result shows that for…

We prove that one-relator groups with torsion are hereditarily conjugacy separable. Our argument is based on a combination of recent results of Dani Wise and the first author. As a corollary we obtain that any quasiconvex subgroup of a…

It is known that the Weyl families corresponding to unitary boundary pairs $(\mathcal{H},\Gamma)$ belong to the class $\tilde{\mathcal{R}}(\mathcal{H})$ of Nevanlinna families. Here we extend the theorem to the case of essentially unitary…

For a connected graph $G$, a spanning tree $T$ of $G$ is called a homeomorphically irreducible spanning tree (HIST) if $T$ has no vertices of degree 2. Albertson {\em et al.} proved that it is $NP$-complete to decide whether a graph…

A conjecture in algorithmic model theory predicts that the model-checking problem for first-order logic is fixed-parameter tractable on a hereditary graph class if and only if the class is monadically dependent. Originating in model theory,…

We consider a distance-regular graph $\G$ with diameter $d \ge 3$ and eigenvalues $k=\theta_0>\theta_1>... >\theta_d$. We show the intersection numbers $a_1, b_1$ satisfy $$ (\theta_1 + {k \over a_1+1}) (\theta_d + {k \over a_1+1}) \ge -…

Let ${\cal F}$ be a family of meromorphic functions on a domain $D$. We present a quite general sufficient condition for ${\cal F}$ to be a normal family. This criterion contains many known results as special cases. The overall idea is that…

Graphs triangulating the $2$-sphere are generically rigid in $3$-space, due to Gluck-Dehn-Alexandrov-Cauchy. We show there is a \emph{finite} subset $A$ in $3$-space so that the vertices of each graph $G$ as above can be mapped into $A$ to…

In this paper we construct an infinite family of homotopically rigid spaces. These examples are then used as building blocks to forge highly connected rational spaces with prescribed finite group of self-homotopy equivalences. They are also…

A family $\mathcal C$ of sets is hereditary if whenever $A\in \mathcal C$ and $B\subset A$, we have $B\in \mathcal C$. Chv\'atal conjectured that the largest intersecting subfamily of a hereditary family is the family of all sets containing…

We study finitely homogeneous dependent rosy structures, adapting results of Cherlin, Harrington, and Lachlan proved for $\omega$-stable $\omega$-categorical structures. In particular, we prove that such structures have finite {\th}-rank…

Conditions are given which imply that certain non-autonomous analytic iterated function systems (NIFS's) in the complex plane have uniformly perfect attractor sets, while other conditions imply the attractor is pointwise thin, and thus…

Following a characterization [10] of locally tabular logics with finitary (or unitary) unification by their Kripke models we determine the unification types of some intermediate logics (extensions of {\sf INT}). There are exactly four…

We show that hereditarily indecomposable spaces can be characterized by a special instance of the Intermediate Value Theorem in their rings of continuous functions.

We show that for any $k\in\omega$, the structure $(H_k,\in)$ of sets that are hereditarily of size at most $k$ is decidable. We provide a transparent complete axiomatization of its theory, a quantifier elimination result, and tight bounds…

A graph is called $d$-rigid if there exists a generic embedding of its vertex set into $\mathbb{R}^d$ such that every continuous motion of the vertices that preserves the lengths of all edges actually preserves the distances between all…

We prove the following variant of Helly's classical theorem for Hamming balls with a bounded radius. For $n>t$ and any (finite or infinite) set $X$, if in a family of Hamming balls of radius $t$ in $X^n$, every subfamily of at most…