اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدReduced Lattices of Synchrony Subspaces and their Indices
68
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
For a regular coupled cell network, synchrony subspaces are the polydiagonal subspaces that are invariant under the network adjacency matrix. The complete lattice of synchrony subspaces of an $n$-cell regular network can be seen as an intersection of the partition lattice of $n$ elements and a lattice of invariant subspaces of the associated adjacency matrix. We assign integer tuples with synchrony subspaces, and use them for identifying equivalent synchrony subspaces to be merged. Based on this equivalence, the initial lattice of synchrony subspaces can be reduced to a lattice of synchrony subspaces which corresponds to a simple eigenvalue case discussed in our previous work. The result is a reduced lattice of synchrony subspaces, which affords a well-defined non-negative integer index that leads to bifurcation analysis in regular coupled cell networks.
قيم البحث
اقرأ أيضاً
We define a graph network to be a coupled cell network where there are only one type of cell and one type of symmetric coupling between the cells. For a difference-coupled vector field on a graph network system, all the cells have the same internal d
ynamics, and the coupling between cells is identical, symmetric, and depends only on the difference of the states of the interacting cells. We define four nested sets of difference-coupled vector fields by adding further restrictions on the internal dynamics and the coupling functions. These restrictions require that these functions preserve zero or are odd or linear. We characterize the synchrony and anti-synchrony subspaces with respect to these four subsets of admissible vector fields. Synchrony and anti-synchrony subspaces are determined by partitions and matched partitions of the cells that satisfy certain balance conditions. We compute the lattice of synchrony and anti-synchrony subspaces for several graph networks. We also apply our theory to systems of coupled van der Pol oscillators.
Lattice-based Cryptography is considered to have the characteristics of classical computers and quantum attack resistance. We will design various graphic lattices and matrix lattices based on knowledge of graph theory and topological coding, since ma
ny problems of graph theory can be expressed or illustrated by (colored) star-graphic lattices. A new pair of the leaf-splitting operation and the leaf-coinciding operation will be introduced, and we combine graph colorings and graph labellings to design particular proper total colorings as tools to build up various graphic lattices, graph homomorphism lattice, graphic group lattices and Topcode-matrix lattices. Graphic group lattices and (directed) Topcode-matrix lattices enable us to build up connections between traditional lattices and graphic lattices. We present mathematical problems encountered in researching graphic lattices, some problems are: Tree topological authentication, Decompose graphs into Hanzi-graphs, Number String Decomposition Problem, $(p,s)$-gracefully total numbers.
In this note, we find a sharp bound for the minimal number (or in general, indexing set) of subspaces of a fixed (finite) codimension needed to cover any vector space V over any field. If V is a finite set, this is related to the problem of partitioning V into subspaces.
We first show that the subgroup of the abelian real group $mathbb{R}$ generated by the coordinates of a point in $x = (x_1,dots,x_n)inmathbb{R}^n$ completely classifies the $mathsf{GL}(n,mathbb Z)$-orbit of $x$. This yields a short proof of J.S.Danis
theorem: the $mathsf{GL}(n,mathbb Z)$-orbit of $xinmathbb{R}^n$ is dense iff $x_i/x_jin mathbb{R} setminus mathbb Q$ for some $i,j=1,dots,n$. We then classify $mathsf{GL}(n,mathbb Z)$-orbits of rational affine subspaces $F$ of $mathbb{R}^n$. We prove that the dimension of $F$ together with the volume of a special parallelotope associated to $F$ yields a complete classifier of the $mathsf{GL}(n,mathbb Z)$-orbit of $F$.
Phylogenetic diversity indices provide a formal way to apportion evolutionary heritage across species. Two natural diversity indices are Fair Proportion (FP) and Equal Splits (ES). FP is also called evolutionary distinctiveness and, for rooted trees,
is identical to the Shapley Value (SV), which arises from cooperative game theory. In this paper, we investigate the extent to which FP and ES can differ, characterise tree shapes on which the indices are identical, and study the equivalence of FP and SV and its implications in more detail. We also define and investigate analogues of these indices on unrooted trees (where SV was originally defined), including an index that is closely related to the Pauplin representation of phylogenetic diversity.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
