Related papers: Graphene nanocones and Pascal matrices
In this paper, we are going to calculate the determinant of a certain type of square matrices, which are related to the well-known Cauchy and Toeplitz matrices. Then, we will use the results to determine the rank of special non-square…
A generalized definition of the determinant of matrices is given, which is compatible with the usual determinant for square matrices and keeps many important properties, such as being an alternating multilinear function, keeping…
The graphene membrane irradiated by weak activating alternative electric field in terahertz range was considered. The quantum approach based on the time-dependent density matrix method was used. The exact solution was obtained for graphene…
There are close relations between tripartite tensors with bounded geometric ranks and linear determinantal varieties with bounded codimensions. We study linear determinantal varieties with bounded codimensions, and prove upper bounds of the…
There is a digraph corresponding to every square matrix over $\mathbb{C}$. We generate a recurrence relation using the Laplace expansion to calculate the characteristic, and permanent polynomials of a square matrix. Solving this recurrence…
We prove that multilinear (tensor) analogues of many efficiently computable problems in numerical linear algebra are NP-hard. Our list here includes: determining the feasibility of a system of bilinear equations, deciding whether a 3-tensor…
We associate with a matrix over an arbitrary field an infinite family of matrices whose sizes vary from one to infinity; their entries are traces of powers of the original matrix. We explicitly evaluate the determinants of matrices in our…
Graph Laplacians on finite compact metric graphs are considered under the assumption that the matching conditions at the graph vertices are of either $\delta$ or $\delta'$ type. In either case, an infinite series of trace formulae which…
We show that the existence of $\{\pm 1\}$-matrices having largest possible determinant is equivalent to the existence of certain tournament matrices. In particular, we prove a recent conjecture of Armario. We also show that large…
We prove a bijection between the triangulations of the 3-dimensional cyclic polytope C(n+2, 3) and persistent graphs with n vertices. We show that under this bijection the Stasheff-Tamari orders on triangulations naturally translate to…
If $G$ is a looped graph, then its adjacency matrix represents a binary matroid $M_{A}(G)$ on $V(G)$. $M_{A}(G)$ may be obtained from the delta-matroid represented by the adjacency matrix of $G$, but $M_{A}(G)$ is less sensitive to the…
This work explores the definiteness of the weighted graph Laplacian matrix with negative edge weights. The definiteness of the weighted Laplacian is studied in terms of certain matrices that are related via congruent and similarity…
By bridging graphene and benzene through a well-defined sequence of polycyclic aromatic hydrocarbons and their inherent shell structure, J. Phys. Chem. C, 2018, 122, 17526, it is shown that graphene is actually a coherent arrangement of…
We consider the tight-binding approximation for the description of energy bands of graphene, together with the standard Boltzmann's transport equation and constant relaxation time, an expression for the conductivity was obtained. We…
In view of the many quantum field theoretical descriptions of graphene in $2+1$ dimensions, we present another field theoretical feature of graphene, in the presence of defects. Particularly, we shall be interested in gapped graphene in the…
In this paper we study some determinant inequalities and matrix inequalities which have a geometrical flavour. We first examine some inequalities which place work of Macbeath [13] in a more general setting and also relate to recent work of…
In this note I prove a~claim on determinants of some special tridiagonal matrices. Together with my result about Fibonacci partitions (arXiv:math/0307150), this claim allows one to prove one (slightly strengthened) Shallit's result about…
In this paper we investigate the influence of the next-nearest-neighbor coupling of tight-binding model of graphene on the spectrum of plasmon excitations. The nearest-neighbor tight-binding model was previously used to calculate plasmon…
Graphene's fluorescence quenching is studied as a function of distance. Transverse decay channels, full retardation and graphene-field coupling to all orders are included, extending previous instantaneous results. For neutral graphene, a…
The density matrix of a graph is the combinatorial laplacian matrix of a graph normalized to have unit trace. In this paper we generalize the entanglement properties of mixed density matrices from combinatorial laplacian matrices of graphs…