Let G=(V,E) be a simple connected graph of order p and size q. A decomposition of a graph G is a collection π of edge-disjoint subgraphs G_1,G_2,…,G_n of G such that every edge of G belongs to exactly one G_i,(1≤i ≤n). The decomposition 〖π={G〗_1,G_2,…,G_n} of a connected graph G is said to be a distinct edge geodetic decomposition if g_1 (G_i )≠g_1 (G_j ),(1≤i≠j≤n). The maximum cardinality of π...

 ‎Let $V$ be an $n$-dimensional complex inner product space‎. ‎Suppose‎ ‎$H$ is a subgroup of the symmetric group of degree $m$‎, ‎and‎ ‎$chi‎ :‎Hrightarrow mathbb{C} $ is an irreducible character (not‎ ‎necessarily linear)‎. ‎Denote by $V_{chi}(H)$ the symmetry class‎ ‎of tensors associated with $H$ and $chi$‎. ‎Let $K(T)in‎ (V_{chi}(H))$ be the operator induced by $Tin‎ ‎text{End}(V)$‎. ‎Th...

The L-decomposable and the bi-decomposable models are two families of distributions on the set Sn of all permutations of the first n positive integers. Both of these models are characterized by collections of conditional independence relations. We first compute a Markov basis for the L-decomposable model, then give partial results about the Markov basis of the bi-decomposable model. Using these...

A n-vertex graph is said to be decomposable if for any partition (λ1, . . . , λp) of the integer n, there exists a sequence (V1, . . . , Vp) of connected vertex-disjoint subgraphs with |Vi| = λi. In this paper, we focus on decomposable trees. We show that a decomposable tree has degree at most 4. Moreover, each degree-4 vertex of a decomposable tree is adjacent to a leaf. This leads to a polyno...

Consider a (possibly infinite) exchangeable sequence X= {Xn : 1≤ n < N}, where N ∈ N ∪ {∞}, with values in a Borel space (A,A), and note Xn = (X1, . . . ,Xn). We say that X is Hoeffding decomposable if, for each n, every square integrable, centered and symmetric statistic based on Xn can be written as an orthogonal sum of n U statistics with degenerated and symmetric kernels of increasing order...

Let G be a finite group and A be a normal subgroup of G. We denote by ncc(A) the number of G-conjugacy classes of A and A is called n-decomposable, if ncc(A) = n. Set KG = {ncc(A)|A⊳ G}. Let X be a non-empty subset of positive integers. A group G is called X-decomposable, if KG = X . Ashrafi and his co-authors [1,2,3,4,5] have characterized the X-decomposable nonperfect finite groups for X = {1...

A n-vertex graph is said to be decomposable if for any partition (λ1, . . . , λp) of the integer n, there exists a sequence (V1, . . . , Vp) of connected vertex-disjoint subgraphs with |Vi| = λi. The aim of the paper is to study the homeomorphism classes of decomposable trees. More precisely, we show that homeomorphism classes containing decomposable trees with an arbitrarily large minimal dist...

‎let $v$ be an $n$-dimensional complex inner product space‎. ‎suppose‎ ‎$h$ is a subgroup of the symmetric group of degree $m$‎, ‎and‎ ‎$chi‎ :‎hrightarrow mathbb{c} $ is an irreducible character (not‎ ‎necessarily linear)‎. ‎denote by $v_{chi}(h)$ the symmetry class‎ ‎of tensors associated with $h$ and $chi$‎. ‎let $k(t)in‎ (v_{chi}(h))$ be the operator induced by $tin‎ ‎text{end}(v)$‎. ‎the...

Decomposability of an algebraic structure into the union of its sub-structures goes back to G. Scorza's Theorem of 1926 for groups. An analogue of this theorem for rings has been recently studied by A. Lucchini in 2012. On the study of this problem for non-group semigroups, the first attempt is due to Clifford's work of 1961 for the regular semigroups. Since then, N.P. Mukherjee in 1972 studied...