Related papers: Reducts of the Generic Digraph
We consider abelian length categories, a generalization of module categories over Artin algebras. Let $\mathcal{A}$ be an abelian length category of colocal type. We show that the lattice $\mathsf{S}(\mathcal{A})$ of full additive subobject…
A skeleton of the category with finite coproducts D freely generated by a single object has a subcategory isomorphic to a skeleton of the category with finite products C freely generated by a countable set of objects. As a consequence, we…
Structures involving a lattice and join-endomorphisms on it are ubiquitous in computer science. We study the cardinality of the set $\mathcal{E}(L)$ of all join-endomorphisms of a given finite lattice $L$. In particular, we show for…
We show that a finitely generated group of analytic diffeomorphisms that is expanding and locally discrete in the analytic category is analytically conjugate to a uniform lattice of a finite covering of the group of projective maps of the…
In this paper we explore homogeneous spaces Z=G/H of a a real reductive Lie group G with a closed connected subgroup H. The investigation concerns the decay at infinity of smooth functions on Z, and L^p-integrability of matrix coefficients.…
A graph \textit{G} is a tuple (\textit{V}, \textit{E}), where \textit{V} is the vertex set, \textit{E} is the edge set. A reduced graph is a graph of deleting non-Hamiltonian edges and smoothing out the redundant vertices of degree 2 on an…
Let $G$ be a real connected Lie group with a left invariant metric $d$, $\mathfrak{g}$ its Lie algebra. In this paper we present a set of interesting upper and lower bounds for $|d\exp_{x}(y)|,\ x,y \in \mathfrak{g}$. If $\textrm{ad}_x$ is…
A closed subgroup of a semisimple algebraic group is called irreducible if it lies in no proper parabolic subgroup. In this paper we classify all irreducible subgroups of exceptional algebraic groups $G$ which are connected, closed and…
We give a characterization of distance--preserving subgraphs of Johnson graphs, i.e. of graphs which are isometrically embeddable into Johnson graphs (the Johnson graph $J(m,\Lambda)$ has the subsets of cardinality $m$ of a set $\Lambda$ as…
A dominating (respectively, total dominating) set $S$ of a digraph $D$ is a set of vertices in $D$ such that the union of the closed (respectively, open) out-neighborhoods of vertices in $S$ equals the vertex set of $D$. The minimum size of…
In this paper we investigate the $directed$ $normalizing$ $graph$ associated with a group $G$, defined as the simple directed graph whose vertices are the elements of $G$, with an arrow from $x$ to $y$ whenever the subgroup $\langle x…
Given a graph $G$, a total dominating set $D_t$ is a vertex set that every vertex of $G$ is adjacent to some vertices of $D_t$ and let $d_t(G,i)$ be the number of all total dominating sets with size $i$. The total domination polynomial,…
To a given gene tree topology $G$ and species tree topology $S$ with leaves labeled bijectively from a fixed set $X$, one can associate a set of ancestral configurations, each of which encodes a set of gene lineages that can be found at a…
We present a detailed study of the geometric and algebraic properties of the multidimensional quadrilateral lattice (a lattice whose elementary quadrilaterals are planar; the discrete analogue of a conjugate net) and of its basic…
Discrete tomography is concerned with the reconstruction of images that are defined on a discrete set of lattice points from their projections in several directions. The range of values that can be assigned to each lattice point is…
We investigate a new lattice of generalised non-crossing partitions, constructed using the geometry of the complex reflection group $G(e,e,r)$. For the particular case $e=2$ (resp. $r=2$), our lattice coincides with the lattice of simple…
Let $D$ be a connected component of a possibly disconnected reductive group $G$ over an algebraic closed field. We define a partition of $D$ into finitely many Strata each of which is a union of $G^0$-conjugacy classes of fixed dimension.…
We define a class of morphisms between strict $\omega$-categories called discrete Conduch{\'e} $\omega$-functors that generalize discrete Conduch{\'e} functors between 1-categories and we study their properties related to polygraphs. The…
Let $G = (V, E)$ be a simple graph of order $n$. The total dominating set of $G$ is a subset $D$ of $V$ that every vertex of $V$ is adjacent to some vertices of $D$. The total domination number of $G$ is equal to minimum cardinality of…
Let $G$ be a connected reductive affine algebraic group defined over $\mathbb C$ and $\mathfrak g$ its Lie algebra. We study the monodromy map from the space of $\mathfrak g$-differential systems on a compact connected Riemann surface…