Related papers: Generalized tournament matrices with the same prin…
A subset of vertices of a graph $G$ is a general position set if no triple of vertices from the set lie on a common shortest path in $G$. In this paper we introduce the general position polynomial as $\sum_{i \geq 0} a_i x^i$, where $a_i$…
In this paper we enumerate the parameter matrices of all perfect 2-colorings of the generalized Petersen graphs GP(n;3), where n>=7. We also give some basic results for GP(n; k).
We establish certain fundamental properties of $f$-vectors and $F$-matrices for generalized cluster algebras, including the initial and final seed mutation formulas, the compatibility property and the symmetry property. Along the way, we…
We consider the spectrum of additive, polynomially vanishing random perturbations of deterministic matrices, as follows. Let $M_N$ be a deterministic $N\times N$ matrix, and let $G_N$ be a complex Ginibre matrix. We consider the matrix…
In this paper, the determinants of $n\times n$ matrices over commutative finite chain rings and over commutative finite principal ideal rings are studied. The number of $n\times n$ matrices over a commutative finite chain ring ${R}$ of a…
This paper studies the unitary diagonalization of matrices over formal power series rings. Our main result shows that a normal matrix is unitarily diagonalizable if and only if its minimal polynomial completely splits over the ring and the…
A tournament on 8 or more vertices may be intrinsically linked as a directed graph. We begin the classification of intrinsically linked tournaments by examining their score sequences. While many distinct tournaments may have the same score…
In this paper we show that determinantal ideals of generic matrices are Knutson ideals. This fact leads to a useful result about Gr\"obner bases of certain sums of determinantal ideals. More specifically, given $I=I_1+\ldots+I_k$ a sum of…
For every algebraically closed field $\boldsymbol k$ of characteristic different from $2$, we prove the following: (1) Generic finite dimensional (not necessarily associative) $\boldsymbol k$-algebras of a fixed dimension, considered up to…
Every sport needs rules. Tournament design refers to the rules that determine how a tournament, a series of games between a number of competitors, is organized. This study aims to provide an overview of the tournament design literature from…
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…
Four results are given that address the existence, ambiguities and construction of a classical R-matrix given a Lax pair. They enable the uniform construction of R-matrices in terms of any generalized inverse of $ad L$. For generic $L$ a…
We consider the group M of all polynomial matrices U(z) = U0 + U1*z + U2*z*z +...+Uk*z*...*z, k=0,1,... that satisfy equation U(z)*D*U(z)" = D with the diagonal n*n matrix D=diag{-1,1,1,...1}. Here n > 1, U(z)" = U0" + U1"*z + U2"*z*z +…
An irreducible norm closed semigroup of complex matrices is simultaneously similar to a semigroup of partial isometries if and only if (a) the norms of all nonzero members of it are uniformly bounded above and below, and (b) its idempotents…
Given a graph whose edges are labeled by ideals of a commutative ring R with identity, a generalized spline is a vertex labeling by the elements of R such that the difference of the labels on adjacent vertices lies in the ideal associated…
Let $\vec{T}_k$ be the transitive tournament on $k$ vertices. We show that every oriented graph on $n=4m$ vertices with minimum total degree $(11/12+o(1))n$ can be partitioned into vertex disjoint $\vec{T}_4$'s, and this bound is…
We study the regularity of the roots of complex monic polynomials $P(t)$ of fixed degree depending smoothly on a real parameter $t$. We prove that each continuous parameterization of the roots of a generic $C^\infty$ curve $P(t)$ (which…
It is well-known that the Pl\"ucker relations generate the ideal of relations of the maximal minors of a generic matrix. In this paper we discuss the relations between minors of a (non-maximal) fixed size. We will exhibit minimal relations…
We define a generalization of the Turing machine that computes on general sets. Our main theorem states that the class of generalized Turing machine computable functions and the class of Set Recursive functions coincide.
For a positive integer $n$, the set of all integers greater than or equal to $n$ is denoted by $\mathcal T(n)$. A sum of generalized $m$-gonal numbers $g$ is called tight $\mathcal T(n)$-universal if the set of all nonzero integers…