Related papers: Quadrangularity in Tournaments
Matrices are the most common representations of graphs. They are also used for the representation of algebras and cluster algebras. This paper shows some properties of matrices in order to facilitate the understanding and locating…
Multicriteria Decision Making problems are important both for individuals and groups. Pairwise comparisons have become popular in the theory and practice of preference modelling and quantification. We focus on decision problems where the…
A banded matrix is a real square matrix where nonzero entries appear around the main diagonal. In this article, we consider linear complementarity properties of (variants) of banded matrices. Focusing on triangular matrices and the newly…
We form a "map of tournaments" by adapting the map framework from the world of elections. By a tournament we mean a complete directed graph where the nodes are the players and an edge points from a winner of a game to the loser (with no…
A sign pattern is an array with entries in $\{+,-,0\}$. A matrix $Q$ is row orthogonal if $QQ^T = I$. The Strong Inner Product Property (SIPP), introduced in [B.A.~Curtis and B.L.~Shader, Sign patterns of orthogonal matrices and the strong…
A new condition, the strong inner product property, is introduced and used to construct sign patterns of row orthogonal matrices. Using this property, infinite families of sign patterns allowing row orthogonality are found. These provide…
We study pairs of mutually orthogonal normal matrices with respect to tropical multiplication. Minimal orthogonal pairs are characterized. The diameter and girth of three graphs arising from the orthogonality equivalence relation are…
The traditional mathematical model for an impartial combinatorial game is defined recursively as a set of the options of the game, where the options are games themselves. We propose a model called gamegraph, together with its generalization…
A trade in a complex Hadamard matrix is a set of entries which can be changed to obtain a different complex Hadamard matrix. We show that in a real Hadamard matrix of order $n$ all trades contain at least $n$ entries. We call a trade…
Strongly chordal digraphs are included in the class of chordal digraphs and generalize strongly chordal graphs and chordal bipartite graphs. They are the digraphs that admit a linear ordering of its vertex set for which their adjacency…
Juggling patterns can be described by a sequence of cards which keep track of the relative order of the balls at each step. This interpretation has many algebraic and combinatorial properties, with connections to Stirling numbers, Dyck…
An oriented graph is said positively multiplicative when its adjacency matrix $A$ embeds in a matrix algebra admitting a basis $\mathsf{B}$ with nonnegative structure constants in which the matrix of the multiplication by $A$ coincides with…
We introduce a notion of compatibility for multiplicity matrices. This gives rise to a necessary condition for the join of two (possibly disconnected) graphs $G$ and $H$ to be the pattern of an orthogonal symmetric matrix, or equivalently,…
A real matrix is said to be positive if its every entry is positive, and a real square matrix A is algebraically positive if there exists a real polynomial f such that f(A) is a positive matrix. A sign pattern matrix A is said to require a…
We say that a digraph $D$ is $(i,j)$-step competitive if any two vertices have an $(i,j)$-step common out-neighbor in $D$ and that a graph $G$ is $(i,j)$-step competitively orientable if there exists an $(i,j)$-step competitive orientation…
Ladder tournaments are widely used to rank individuals in real-world organizations and games. Their mathematical properties however are still poorly understood. We formalize the ranking rule generated by a ladder tournament, and we show…
A novel method to obtain parametrizations of complex inverse orthogonal matrices is provided. These matrices are natural generalizations of complex Hadamard matrices which depend on non zero complex parameters. The method we use is via…
A circle pattern is a configuration of circles in the plane whose combinatorics is given by a planar graph G such that to each vertex of G corresponds a circle. If two vertices are connected by an edge in G, the corresponding circles…
A zero-one matrix $A$ contains another zero-one matrix $P$ if some submatrix of $A$ can be transformed to $P$ by changing some ones to zeros. $A$ avoids $P$ if $A$ does not contain $P$. The Pattern Avoidance Game is played by two players.…
A Formal Orthogonal Pair is a pair $(A,B)$ of symbolic rectangular matrices such that $AB^T=0$. It can be applied for the construction of Hadamard and Weighing matrices. In this paper we introduce a systematic way for constructing such…