Related papers: Principal $\Gamma$-cone for a tree

Phylogenetic analysis of DNA or other data commonly gives rise to a collection or sample of inferred evolutionary trees. Principal Components Analysis (PCA) cannot be applied directly to collections of trees since the space of evolutionary…

Let $\Gamma$ be a finite connected graph. The (unlabelled) configuration space $UC^n \Gamma$ of $n$ points on $\Gamma$ is the space of $n$-element subsets of $\Gamma$. The $n$-strand braid group of $\Gamma$, denoted $B_n\Gamma$, is the…

An arborescence of a directed graph $\Gamma$ is a spanning tree directed toward a particular vertex $v$. The arborescences of a graph rooted at a particular vertex may be encoded as a polynomial $A_v(\Gamma)$ representing the sum of the…

This article studies generalizations of (matrix) convexity, including partial convexity and biconvexity, under the umbrella of $\Gamma$-convexity. Here $\Gamma$ is a tuple of free symmetric polynomials determining the geometry of a…

Let $\Gamma$ be a finite graph and let $\Gamma^{\mathrm{e}}$ be its extension graph. We inductively define a sequence $\{\Gamma_i\}$ of finite induced subgraphs of $\Gamma^{\mathrm{e}}$ through successive applications of an operation called…

We develop a notion of a dual of a graph, generalizing the definition of Goulden and Yong (which only applied to trees), and reproving their main result using our new notion. We in fact give three definitions of the dual: a graph-theoretic…

In this paper, after presenting the results of the generalization of Pascal triangle (using powers of base numbers), we examine some properties of the 112-based triangle, most of all regarding to prime numbers. Additionally, an effective…

We formalize an existing computability-theoretic method of presenting first-order structures whose domains have the cardinality of the continuum. Work using these methods until now has emphasized their topological properties. We shift the…

Let $\Gamma$ be a triangulation of a connected closed $2$-dimensional (not necessarily orientable) surface. Using zigzags (closed left-right paths), for every face of $\Gamma$ we define the $z$-monodromy which acts on the oriented edges of…

The prime graph, or Gruenberg--Kegel graph, of a finite group $G$ is the graph $\Gamma(G)$ whose vertices are the prime divisors of $|G|$, and whose edges are the pairs $\{p,q\}$ for which $G$ contains an element of order $pq$. A finite…

We consider a finite set $E$ of points in the $n$-dimensional affine space and two sets of objects that are generated by the set $E$: the system $\Sigma$ of $n$-dimensional simplices with vertices in $E$ and the system $\Gamma$ of chambers.…

In this short notice we give a universal definition of $\Z_2$-module $Or(\Gamma)$ of orientations of a graph $\Gamma$ and construct a method, by means of which one can easily verify whenever two such special definitions coincide.

The total domination number $\gamma_{t}(G)$ of a graph $G$ is the cardinality of a smallest set $D\subseteq V(G)$ such that each vertex of $G$ has a neighbor in $D$. The annihilation number $a(G)$ of $G$ is the largest integer $k$ such that…

A dominating set in a graph $G$ is a set $S$ of vertices such that every vertex that does not belong to $S$ is adjacent to a vertex in $S$. The domination number $\gamma(G)$ of $G$ is the minimum cardinality of a dominating set of $G$. The…

The {\em Fibonacci cube} of dimension $n$, denoted as $\Gamma\_n$, is the subgraph of $n$-cube $Q\_n$ induced by vertices with no consecutive 1's. We study the maximum number of disjoint subgraphs in $\Gamma\_n$ isomorphic to $Q\_k$, and…

Let $\Gamma^{(x_0)}$ be a finite rooted tree, for which $\Gamma$ is the underlying tree and $x_0$ the root. Let $T$ be the Terwilliger algebra of $\Gamma$ with respect to $x_0$. We study the structure of the principal $T$-module. As a…

We consider projections of points onto fundamental chambers of finite real reflection groups. Our main result shows that for groups of type $A_n$, $B_n$, and $D_n$, the coefficients of the characteristic polynomial of the reflection…

We combine the two fundamental fixed-order tangle theorems of Robertson and Seymour into a single theorem that implies both, in a best possible way. We show that, for every $k \in \mathbb{N}$, every tree-decomposition of a graph $G$ which…

The co-maximal subgroup graph $\Gamma(G)$ of a group $G$ is a graph whose vertices are non-trivial proper subgroups of $G$ and two vertices $H$ and $K$ are adjacent if $HK=G$. In this paper, we continue the study of $\Gamma(G)$, especially…

This paper works as an appendix of the paper titled Geometry of Associated Quantum Vector Bundles and the Quantum Gauge Group and for paper titled Yang-Mills-Connes Theory and Quantum Principal SU(N)-Bundles. Here, we are going to prove…