ترغب بنشر مسار تعليمي؟ اضغط هنا

Tensor products of coherent configurations

91   0   0.0 ( 0 )
 نشر من قبل Ilia Ponomarenko
 تاريخ النشر 2021
  مجال البحث الهندسة المعلوماتية
والبحث باللغة English




اسأل ChatGPT حول البحث

A Cartesian decomposition of a coherent configuration $cal X$ is defined as a special set of its parabolics that form a Cartesian decomposition of the underlying set. It turns out that every tensor decomposition of $cal X$ comes from a certain Cartesian decomposition. It is proved that if the coherent configuration $cal X$ is thick, then there is a unique maximal Cartesian decomposition of $cal X$, i.e., there is exactly one internal tensor decomposition of $cal X$ into indecomposable components. In particular, this implies an analog of the Krull--Schmidt theorem for the thick coherent configurations. A polynomial-time algorithm for finding the maximal Cartesian decomposition of a thick coherent configuration is constructed.



قيم البحث

اقرأ أيضاً

70 - Takafumi Kouno 2018
A Demazure crystal is the basis at $q=0$ of a Demazure module. Demazure crystals play an important role in Schubert calculus because the character of a Demazure crystal in type A is identical to a key polynomial, which is closely related to Schubert polynomials. In this paper, we study tensor products of Demazure crystals. Each connected component of a tensor product of Demazure crystals need not be isomorphic to some Demazure crystal. We provide a necessary and sufficient condition for every connected component of a tensor product to be isomorphic to some Demazure crystal. Also, we obtain the explicit formula for connected components. As applications, we study the positivity for structure constants of products of key polynomials, and we obtain an equation of crystals, which is an analog of the Leibniz rule for Demazure operators.
A permutation group is said to be quasiregular if every its transitive constituent is regular, and a quasiregular coherent configuration can be thought as a combinatorial analog of such a group: the transitive constituents are replaced by the homogen eous components. In this paper, we are interested in the question when the configuration is schurian, i.e., formed by the orbitals of a permutation group, or/and separable, i.e., uniquely determined by the intersection numbers. In these terms, an old result of Hanna Neumann is, in a sense, dual to the statement that the quasiregular coherent configurations with cyclic homogeneous components are schurian. In the present paper, we (a) establish the duality in a precise form and (b) generalize the latter result by proving that a quasiregular coherent configuration is schurian and separable if the groups associated with homogeneous components have distributive lattices of normal subgroups.
405 - David R. Wood 2011
A clique minor in a graph G can be thought of as a set of connected subgraphs in G that are pairwise disjoint and pairwise adjacent. The Hadwiger number h(G) is the maximum cardinality of a clique minor in G. This paper studies clique minors in the C artesian product G*H. Our main result is a rough structural characterisation theorem for Cartesian products with bounded Hadwiger number. It implies that if the product of two sufficiently large graphs has bounded Hadwiger number then it is one of the following graphs: - a planar grid with a vortex of bounded width in the outerface, - a cylindrical grid with a vortex of bounded width in each of the two `big faces, or - a toroidal grid. Motivation for studying the Hadwiger number of a graph includes Hadwigers Conjecture, which states that the chromatic number chi(G) <= h(G). It is open whether Hadwigers Conjecture holds for every Cartesian product. We prove that if |V(H)|-1 >= chi(G) >= chi(H) then Hadwigers Conjecture holds for G*H. On the other hand, we prove that Hadwigers Conjecture holds for all Cartesian products if and only if it holds for all G * K_2. We then show that h(G * K_2) is tied to the treewidth of G. We also develop connections with pseudoachromatic colourings and connected dominating sets that imply near-tight bounds on the Hadwiger number of grid graphs (Cartesian products of paths) and Hamming graphs (Cartesian products of cliques).
We study a family of variants of ErdH os unit distance problem, concerning distances and dot products between pairs of points chosen from a large finite point set. Specifically, given a large finite set of $n$ points $E$, we look for bounds on how ma ny subsets of $k$ points satisfy a set of relationships between point pairs based on distances or dot products. We survey some of the recent work in the area and present several new, more general families of bounds.
A $k$-matching $M$ of a graph $G=(V,E)$ is a subset $Msubseteq E$ such that each connected component in the subgraph $F = (V,M)$ of $G$ is either a single-vertex graph or $k$-regular, i.e., each vertex has degree $k$. In this contribution, we are int erested in $k$-matchings within the four standard graph products: the Cartesian, strong, direct and lexicographic product. As we shall see, the problem of finding non-empty $k$-matchings ($kgeq 3$) in graph products is NP-complete. Due to the general intractability of this problem, we focus on distinct polynomial-time constructions of $k$-matchings in a graph product $Gstar H$ that are based on $k_G$-matchings $M_G$ and $k_H$-matchings $M_H$ of its factors $G$ and $H$, respectively. In particular, we are interested in properties of the factors that have to be satisfied such that these constructions yield a maximum $k$-matching in the respective products. Such constructions are also called well-behaved and we provide several characterizations for this type of $k$-matchings. Our specific constructions of $k$-matchings in graph products satisfy the property of being weak-homomorphism preserving, i.e., constructed matched edges in the product are never projected to unmatched edges in the factors. This leads to the concept of weak-homomorphism preserving $k$-matchings. Although the specific $k$-matchings constructed here are not always maximum $k$-matchings of the products, they have always maximum size among all weak-homomorphism preserving $k$-matchings. Not all weak-homomorphism preserving $k$-matchings, however, can be constructed in our manner. We will, therefore, determine the size of maximum-sized elements among all weak-homomorphims preserving $k$-matching within the respective graph products, provided that the matchings in the factors satisfy some general assumptions.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا