相关论文: A directed graph structure of alternating sign mat…

Permutation tableaux are combinatorial objects related with permutations and various statistics on them. They appeared in connection with total positivity in Grassmannians, and stationary probabilities in a PASEP model. In particular they…

The action of a finite reflection group (type A) on its set of roots is understood as a permutation representation or group action. We show that this representation is an induced representation from a certain kind of parabolic subgroup.…

Directed mixed graphs permit directed and bidirected edges between any two vertices. They were first considered in the path analysis developed by Sewall Wright and play an essential role in statistical modeling. We introduce a matrix…

In this paper, we construct directed strongly regular graphs and divisible design graphs with new parameters merging some basic relations of so-called Tatra associations schemes. We also study the above association schemes, their fusions…

For a graph with edge ordering, a linear order on the edge set, we obtain a permutation of vertices by considering the edges as transpositions of endvertices. It is known from D\'enes' results that the permutation of a tree is a full cyclic…

In this paper, we define and characterize signed interval graphs and bigraphs introducing the concept of negative interval. Also we have shown that these classes of graphs are respectively a generalization of well known classes of interval…

A permutation graph is a graph whose edges are given by inversions of a permutation. We study the Abelian sandpile model (ASM) on such graphs. We exhibit a bijection between recurrent configurations of the ASM on permutation graphs and the…

Bayesian statistical graphical models are typically classified as either continuous and parametric (Gaussian, parameterized by the graph-dependent precision matrix with Wishart-type priors) or discrete and non-parametric (with…

We study some geometric and combinatorial aspects of the solution to the full Kostant-Toda (f-KT) hierarchy, when the initial data is given by an arbitrary point on the totally non-negative (tnn) flag variety of SL_n(R). The f-KT flows on…

Threshold tolerance graphs and their complement graphs, known as co-TT graphs, were introduced by Monma, Reed, and Trotter[24]. Building on this, Hell et al.[19] introduced the concept of negative interval. Then they proceeded to define…

It has been shown that the adjacency eigenspace of a network contains key information of its underlying structure. However, there has been no study on spectral analysis of the adjacency matrices of directed signed graphs. In this paper, we…

We establish analytically several new identities connecting enumerators of different types of circulant graphs of prime, twice prime and prime-squared orders. In particular, it is shown that the semi-sum of the number of undirected…

We study the enumeration of diagonally and antidiagonally symmetric alternating sign matrices (DASASMs) of fixed odd order by introducing a case of the six-vertex model whose configurations are in bijection with such matrices. The model…

Structure learning methods for covariance and concentration graphs are often validated on synthetic models, usually obtained by randomly generating: (i) an undirected graph, and (ii) a compatible symmetric positive definite (SPD) matrix. In…

In this paper, we study the inverse signed total domination number in graphs and present new lower and upper bounds on this parameter. For example by making use of the classic theorem of Turan (1941), we present a sharp upper bound for…

In 1988, Duval introduced the concept of directed strongly regular graphs, which can be viewed as a directed graph version of strongly regular graphs. Such directed graphs have similar structural and algebraic properties to strongly regular…

This paper proposes a simple procedure to decide whether the empirically-observed adjacency or weights matrix, which characterizes the graph underlying a socio-economic network, is sufficiently symmetric (respectively, asymmetric) to…

Graph fractional Fourier transform (GFRFT) is an extension of graph Fourier transform (GFT) that provides an additional fractional analysis tool for graph signal processing (GSP) by generalizing temporal-vertex domain Fourier analysis to…

Graph C*-algebras have been celebrated as C*-algebras that can be seen, because many important properties may be determined by looking at the underlying graph. This paper introduces the permutation graph for a permutative endomorphism of a…

In 2005 J.L. Waldspurger proved the following theorem: given a finite real reflection group $W$, the closed positive root cone is tiled by the images of the open weight cone under the action of the linear transformations $id-w$. Shortly…