Related papers: Smith Normal Forms of Graphical Hermite Simplices
A method for finding an optimum $n$-dimensional commutative group code of a given order $M$ is presented. The approach explores the structure of lattices related to these codes and provides a significant reduction in the number of…
Let G be a complete convex geometric graph on 2m vertices, and let F be a family of subgraphs of G. A blocker for F is a set of edges, of smallest possible size, that meets every element of F. In [C. Keller and M. A. Perles, On the smallest…
We give formulas, in terms of graph theoretical invariants, for the minimum distance and the generalized Hamming weights of the linear code generated by the rows of the incidence matrix of a signed graph over a finite field, and for those…
Percolation refers to an interesting class of problems related to the properties of disordered systems, usually formulated in terms of objects randomly placed on an underlying lattice or continuum. Despite the simplicity of the setup, most…
We give unique analytic "normal forms" for germs of a holomorphic vector field of the complex plane in the neighborhood of an isolated singularity of saddle-node type having a convergent formal separatrix. We specifically address the…
It is known that non-isomorphic strongly regular graphs with the same parameters must be cospectral (have the same eigenvalues). In this paper, we investigate whether the spectra of higher order Laplacians associated with these graphs can…
A hypergraph can be obtained from a simplicial complex by deleting some non-maximal simplices. By [11], a hypergraph gives an associated simplicial complex. By [4], the embedded homology of a hypergraph is the homology of the infimum chain…
The purpose of this paper is to give a better understanding of complex points up to quadratic terms of real codimension $2$ submanifolds embedded in a complex $3$-manifold. We answer the question how a normal form of a pair of one arbitrary…
Equifacetal simplices, all of whose codimension one faces are congruent to one another, are studied. It is shown that the isometry group of such a simplex acts transitively on its set of vertices, and, as an application, equifacetal…
These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…
We reconsider density matrices of graphs as defined in [quant-ph/0406165]. The density matrix of a graph is the combinatorial laplacian of the graph normalized to have unit trace. We describe a simple combinatorial condition (the "degree…
Introduced the quantitative measure of the structural complexity of the graph (complex network, etc.) based on a procedure similar to the renormalization process, considering the difference between actual and averaged graph structures on…
Interconnected networks of rigid struts are critical for application in lightweight, load-bearing structures. However, accurately modeling stress distribution in these strut lattices poses significant computational challenges due to its…
We study the symmetry classes of graphene quantum dots, both open and closed, through the conductance and energy level statistics. For abrupt termination of the lattice, these properties are well described by the standard orthogonal and…
Traditional graph centrality measures effectively quantify node importance but fail to capture the structural uniqueness of multi-scale connectivity patterns -- critical for understanding network resilience and function. This paper…
A graph $G$ covers a graph $H$ if there exists a locally bijective homomorphism from $G$ to $H$. We deal with regular covers in which this locally bijective homomorphism is prescribed by an action of a subgroup of ${\rm Aut}(G)$. Regular…
The main objective of the present paper is to set up the theoretical basis and the language needed to deal with the problem of direct images of hermitian vector bundles for projective non-necessarily smooth morphisms. To this end, we first…
The exploration of solid-solid phase transition suffers from the uncertainty of how atoms in two crystal structures match. We devised a theoretical framework to describe and classify crystal-structure matches (CSM). Such description fully…
We construct the Hasse diagrams $G_2$ and $G_3$ for the closure ordering on the sets of congruence classes of $2\times 2$ and $3\times 3$ complex matrices. In other words, we construct two directed graphs whose vertices are $2\times 2$ or,…
The past decade has seen a flourishing of advances in harmonic analysis of graphs. They lie at the crossroads of graph theory and such analytical tools as graph Laplacians, Markov processes and associated boundaries, analysis of path-space,…