Related papers: Another proof of the alternating sign matrix conje…
We investigate a class of 2-edge coloured bipartite graphs known as alternating signed bipartite graphs (ASBGs) that encode the information in alternating sign matrices. The central question is when a given bipartite graph admits an…
In this paper we give necessary and sufficient trace conditions for an n by n matrix over any commutative and associative ring with unity to be a sum of k-th powers of matrices over that ring, where n,k are integers greater equal 2. We…
An $n\times n$ matrix $M=[m_{ij}]$ with $m_{ij}\in U_n=\{1,2,\ldots,n\}$ will be called a cycle matrix if $(U_n,\cdot)$ is a cycle set, where $i\cdot j=m_{ij}$. We study these matrices in this article. Using these matrices, we give some…
We show that any n-vertex complete graph with edges colored with three colors contains a set of at most four vertices such that the number of the neighbors of these vertices in one of the colors is at least 2n/3. The previous best value,…
We study linear relations between color-ordered all-plus amplitudes at one loop in Yang--Mills theory. We show that on general grounds, there are $(n-1)!/2-2$ relations for $n\ge 5$, leaving only two independent color-ordered amplitudes. We…
The Markov numbers are the positive integer solutions of the Diophantine equation $x^2 + y^2 + z^2 = 3xyz$. Already in 1880, Markov showed that all these solutions could be generated along a binary tree. So it became quite usual (and…
The \textit{sepr-sequence} of an $n\times n$ real matrix $A$ is $(s_1,\ldots,s_n)$, where $s_k$ is the subset of those signs of $+,-,0$ that appear in the values of the $k\times k$ principal minors of $A$. The $12\times 12$ matrix…
In this paper we report on new results relating to a conjecture regarding properties of $n\times n$, $n\leq 6$, positive definite matrices. The conjecture has been proven for $n\leq 4$ using computer-assisted sum of squares (SoS) methods…
Alternating sign matrices (ASMs) are square matrices with entries 0, 1, or -1 whose rows and columns sum to 1 and whose nonzero entries alternate in sign. We present a unifying perspective on ASMs and other combinatorial objects by studying…
A signed graph is a graph whose edges are labeled positive or negative. The sign of a cycle is the product of the signs of its edges. Zaslavsky proved in 2012 that, up to switching isomorphism, there are six different signed Petersen…
We provide an alternating proof of sharp inequalities related with Burnside's formula for $n!$
We investigate the possible regular solutions of the boundary Yang-Baxter equation for the vertex models associated with the $A_{n-1}^{(1)}$ affine Lie algebra. We have classified them in two classes of solutions. The first class consists…
We show that the set of prime numbers has exponential alternating complexity, proving a conjecture by Fijalkow. We further show that the set of squarefree integers has essentially maximal possible alternating complexity.
We prove a reflection theorem, conjectured by Nakagawa and Ohno, for the number of quartic rings, or pairs of ternary quadratic forms, with a given cubic resolvent. Over $\mathbb{Z}$, our results are unconditional; we also allow the base to…
The sign-coherence about $c$-vectors was conjectured by Fomin-Zelevinsky and solved completely by Gross-Hacking-Keel-Kontsevich for integer skew-symmetrizable case. We prove this conjecture associated with $c$-vectors for rank 3 real…
The aim of this note is to prove that fluctuations of uniformly random alternating sign matrices (equivalently, configurations of the six-vertex model with domain wall boundary conditions) near the boundary are described by the Gaussian…
The problem of the limit shape of large alternating sign matrices (ASMs) is addressed by studying the emptiness formation probability (EFP) in the domain-wall six-vertex model. Assuming that the limit shape arises in correspondence to the…
Extending previous work on $a_2^{(1)}$, we present a set of reflection matrices, which are explicit solutions to the $a_n^{(1)}$ boundary Yang-Baxter equation. Unlike solutions found previously these are multiplet-changing $K$-matrices, and…
Drisko proved that $2n-1$ matchings of size $n$ in a bipartite graph have a rainbow matching of size $n$. For general graphs it is conjectured that $2n$ matchings suffice for this purpose (and that $2n-1$ matchings suffice when $n$ is…
An $n\times n$ sign pattern $S$, which is a matrix with entries $0,+,-$, is called spectrally arbitrary if any monic real polynomial of degree $n$ can be realized as a characteristic polynomial of a matrix obtained by replacing the non-zero…