On determinants of tournaments and $\mathcal{D}_k$
Combinatorics
2024-08-14 v1
Abstract
Let be a tournament with vertices . The skew-adjacency matrix of is the zero-diagonal matrix in which if dominates . We define the determinant of as the determinant of . It is well-known that if is odd and is the square of an odd integer if is even. Let be the set of tournaments whose all subtournaments have determinant at most , where is a positive odd integer. The necessary and sufficient condition for or has been characterized in . In this paper, we characterize the set , obtain some properties of . Moreover, for any positive odd integer , we give a construction of a tournament satisfying that , and if , which implies is not an empty set for .
Keywords
Cite
@article{arxiv.2408.06992,
title = {On determinants of tournaments and $\mathcal{D}_k$},
author = {Jing Zeng and Lihua You},
journal= {arXiv preprint arXiv:2408.06992},
year = {2024}
}
Comments
28 pages, 1 figure