Related papers: Bordered complex Hadamard matrices and strongly re…
We study the complexity of multiplication in noncommutative group algebras which is closely related to the complexity of matrix multiplication. We characterize such semisimple group algebras of the minimal bilinear complexity and show…
In this paper, first we revisit the formal integration of Lie algebras, which give rise to braces in some special cases. Then we establish the formal integration theory for complete Rota-Baxter Lie algebras, that is, we show that there is a…
We study a new class of quiver algebras on surfaces, called 'geodesic ghor algebras'. These algebras generalize cancellative dimer algebras on a torus to higher genus surfaces, where the relations come from perfect matchings rather than a…
In 2018, by Ramsey and Hoffman theory, Koolen, Yang, and Yang presented a structural result on graphs with smallest eigenvalue at least $-3$ and large minimum degree. In this study, we depart from the conventional use of Ramsey theory and…
This work investigates the existence of complex structures on 2-step nilpotent Lie algebras arising from finite graphs. We introduce the notion of adapted complex structure, namely a complex structure that maps vertices and edges of the…
In this paper three Schur ring are discussed, namenly: Hamming, circulant orbists and decimated circulant orbits Schur ring. By using autocorrelation function and the run structure of binary sequences we proof the relation between this…
A crossed module is (A,H,d,\la) where d:A\to H is a homomorphism of groups and H acts on A, with conditions leading to a groupoid A\lcross H{\to\atop \to}H as an example of a strict 2-group. We give the corresponding notion of a quantum…
We proved the so called complex bounds for multimodal, infinitely renormalizable analytic maps with bounded combinatorics: deep renormalizations have polynomial-like extensions with definite modulus. The complex bounds is the first step to…
We introduce a relaxation of the notion of tensor rank, called s-rank, and show that upper bounds on the s-rank of the matrix multiplication tensor imply upper bounds on the ordinary rank. In particular, if the "s-rank exponent of matrix…
We present an abstract framework for the axiomatic study of diagram algebras. Algebras that fit this framework possess analogues of both the Murphy and seminormal bases of the Hecke algebras of the symmetric groups. We show that the…
We construct a nondegenerate symmetric bilinear form on quantized enveloping algebras associated to Borcherds superalgebras. With this, we study its center and its universal R-matrix.
We study the problem of constructing mutually unbiased bases in dimension six. This approach is based on an efficient numerical method designed to find solutions to the quantum state reconstruction problem in finite dimensions. Our…
We present the exact solution of a family of fragmented Bose-Hubbard models and represent the models as graphs with the condensates in the vertices. The models are solved by the algebraic Bethe ansatz method. We show that the models have…
With any non necessarily orientable unpunctured marked surface (S,M) we associate a commutative algebra, called quasi-cluster algebra, equipped with a distinguished set of generators, called quasi-cluster variables, in bijection with the…
Based on the Connes--Kreimer Hopf algebra of rooted trees, the rooted tree maps are defined as linear maps on noncommutative polynomial algebra in two indeterminates. It is known that they induce a large class of linear relations for…
In recent years it has been noted that a number of combinatorial structures such as real and complex hyperplane arrangements, interval greedoids, matroids and oriented matroids have the structure of a finite monoid called a left regular…
The chordal ring (CR) graphs are a well-known family of graphs used to model some interconnection networks for computer systems in which all nodes are in a cycle. Generalizing the CR graphs, in this paper, we introduce the families of…
Given a finite simple graph $\Gamma$ on $n$ vertices its complementary prism is the graph $\Gamma\bar{\Gamma}$ that is obtained from $\Gamma$ and its complement $\bar{\Gamma}$ by adding a perfect matching, where each its edge connects two…
In this paper, motivated by a question posed in \cite{AH}, we introduce strongly biconvex graphs as a subclass of weakly chordal and bipartite graphs. We give a linear time algorithm to find an induced matching for such graphs and we prove…
Half graphs and their variants, such as ladders, semi-ladders and co-matchings, are combinatorial objects that encode total orders in graphs. Works by Adler and Adler (Eur. J. Comb.; 2014) and Fabia\'nski et al. (STACS; 2019) prove that in…