Related papers: Reducts of the Generic Digraph
For a finite lattice L, let EL denote the reflexive and transitive closure of the join-dependency relation on L, defined on the set J(L) of all join-irreducible elements of L. We characterize the relations of the form EL, as follows:…
The structure of the coincidence symmetry group of an arbitrary $n$-dimensional lattice in the $n$-dimensional Euclidean space is considered by describing a set of generators. Particular attention is given to the coincidence isometry…
We introduce a new class of partial actions of free groups on totally disconnected compact Hausdorff spaces, which we call convex subshifts. These serve as an abstract framework for the partial actions associated with finite separated…
Let p be a singular point of a variety. Consider a resolution where the preimage of p is a simple normal crossing divisor E. The combinatorial structure of E is described by a cell complex D(E), called the dual graph or dual complex of E.…
A set of vertices $S$ \emph{resolves} a connected graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The \emph{metric dimension} of $G$ is the minimum cardinality of a resolving set of $G$.…
Omni-Lie algebroids are generalizations of Alan Weinstein's omni-Lie algebras. A Dirac structure in an omni-Lie algebroid $\dev E\oplus \jet E$ is necessarily a Lie algebroid together with a representation on $E$. We study the geometry…
We consider lattice equations on ${\mathds{Z}}^2$ which are autonomous, affine linear and possess the symmetries of the square. Some basic properties of equations of this type are derived, as well as a sufficient linearization condition and…
Let G be a real or complex linear algebraic reductive group. Let H and F be reductive subgroups. We study the natural H action on G/F. The main theorem of this note shows that generic H orbits are closed. This theorem is then applied to…
Lattice structures play a central role in spectral graph theory, offering analytical insight into diffusion, synchronization, and transport processes on regular discrete spaces. While their spectral properties are completely characterized…
By a rectangular distributive lattice we mean the direct product of two non-singleton finite chains. We prove that the retracts (ordered by set inclusion and together with the empty set) of a rectangular distributive lattice $G$ form a…
For a graph $G = (V, E)$, the $\gamma$-graph of $G$, denoted $G(\gamma) = (V(\gamma), E(\gamma))$, is the graph whose vertex set is the collection of minimum dominating sets, or $\gamma$-sets of $G$, and two $\gamma$-sets are adjacent in…
In this paper, we describe the possible disconnected complex reductive algebraic groups $E$ with component group $\Gamma = E/E_0$. We show that there is a natural bijection between such groups $E$ and algebraic extensions of $\Gamma$ by…
Differential calculus on discrete sets is developed in the spirit of noncommutative geometry. Any differential algebra on a discrete set can be regarded as a `reduction' of the `universal differential algebra' and this allows a systematic…
Let $G$ be a connected complex Lie group. A real form of $G$ is a closed subgroup $H\subset G$ whose Lie algebra $\mathfrak{h}$ is a real form of the Lie algebra $\mathfrak{g}$ of $G$. A pair $(G,H)$ of this type is reductive, and the…
Digraphs are generalizations of graphs in which each edge is assigned with a direction or two directions. In this paper, we define discrete Morse functions on digraphs, and prove that the homology of the Morse complex and the path homology…
Let $G$ be a finite group, and let $\Delta(G)$ be the prime graph built on the set of conjugacy class sizes of $G$: this is the simple undirected graph whose vertices are the prime numbers dividing some conjugacy class size of $G$, two…
This paper is a contribution to the study of the subgroup structure of exceptional algebraic groups over algebraically closed fields of arbitrary characteristic. Following Serre, a closed subgroup of a semisimple algebraic group $G$ is…
We prove that every finite distributive lattice is isomorphic to a final segment of the d.c.e. Turing degrees (i.e., the degrees of differences of computably enumerable sets). As a corollary, we are able to infer the undecidability of the…
Let $G$ be a connected closed subgroup of $\mathrm{GL}_n(\mathbb{C})$ which is simple as a Lie group and which acts irreducibly on $\mathbb{C}^n$. Regarding both $G$ and its Lie algebra $\mathfrak{g}$ as subsets of $M_n(\mathbb{C})$, we…
We propose a functional description of rewriting systems where reduction rules are represented by linear maps called reduction operators. We show that reduction operators admit a lattice structure. Using this structure we define the notion…