Vertices of Suborbital Graph $F_{u,N}$ under Lorentz Matrix Multiplication
نویسندگان
چکیده
In this study, suborbital graphs, $G_{u,N}$ and $F_{u,N}$ are examined. Modular group $\Gamma$ its act on $\widehat{\mathbb{Q}}$ studied. Lorentz matrix that gives the vertices obtained under classical multiplication in graph is analysed with multiplication. written as Möbius transform normalized type of researched. Moreover, a different element scrutinized. The path starting $\infty$ For path, it shown satisfied farthest vertex condition for previous vertex.
منابع مشابه
Graph Parsing by Matrix Multiplication
Graph data model is widely used in many areas, for example, bioinformatics, graph databases, RDF. One of the most common graph queries are navigational queries. The result of query evaluation are implicit relations between nodes of the graph, i.e. paths in the graph. A natural way to specify these relations is by specifying paths using formal grammars over edge labels. The answer to the context...
متن کاملSubgraphs of pair vertices Lorentz Jäntschi
Subgraphs obtained by applying several fragmentation criteria are investigated. Two well known criteria (Szeged and Cluj), and two new others are defined and characterized. An example is given for the discussed procedures. The matrix and polynomial representations of vertices composing each type of subgraphs were also given. Analytical formulas for the polynomials of several classes of graphs a...
متن کاملAsymptotic tensor rank of graph tensors: beyond matrix multiplication
We present an upper bound on the exponent of the asymptotic behaviour of the tensor rank of a family of tensors defined by the complete graph on k vertices. For k ≥ 4, we show that the exponent per edge is at most 0.77, outperforming the best known upper bound on the exponent per edge for matrix multiplication (k = 3), which is approximately 0.79. We raise the question whether for some k the ex...
متن کاملA Graph Expansion and Communication Costs of Fast Matrix Multiplication
The communication cost of algorithms (also known as I/O-complexity) is shown to be closely related to the expansion properties of the corresponding computation graphs. We demonstrate this on Strassen’s and other fast matrix multiplication algorithms, and obtain the first lower bounds on their communication costs. In the sequential case, where the processor has a fast memory of size M , too smal...
متن کاملGraph Expansion and Communication Costs of Fast Matrix Multiplication
The communication cost of algorithms (also known as I/Ocomplexity) is shown to be closely related to the expansion properties of the corresponding computation graphs. We demonstrate this on Strassen’s and other fast matrix multiplication algorithms, and obtain the first lower bounds on their communication costs. For sequential algorithms these bounds are attainable and so optimal.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of new theory
سال: 2022
ISSN: ['2149-1402']
DOI: https://doi.org/10.53570/jnt.1161715