English
Related papers

Related papers: Patterns of Alternating Sign Matrices

200 papers

Lascoux and Sch\"utzenberger introduced a notion of key associated to any Young tableau. More recently Lascoux defined the key of an alternating sign matrix by recursively removing all -1's in such matrices. But alternating sign matrices…

Combinatorics · Mathematics 2009-05-18 Jean-Christophe Aval

It is known that the arc index of alternating knots is the minimal crossing number plus two and the arc index of prime nonalternating knots is less than or equal to the minimal crossing number. We study some cases when the arc index is…

Geometric Topology · Mathematics 2011-06-15 Gyo Taek Jin , Hwa Jeong Lee

Some skew-symmetrizable integer exchange matrices are associated to ideal (tagged) triangulations of marked bordered surfaces. These exchange matrices admits unfoldings to skew-symmetric matrices. We develop an combinatorial algorithm that…

Combinatorics · Mathematics 2012-02-07 Weiwen Gu

We consider the class of directed graphs with $N\geq 1$ edges and without loops shorter than $k\geq1$. Using the concept of a labelled graph, we determine graphs from this class that maximize the number of all paths of length $k$. Then we…

Combinatorics · Mathematics 2026-03-24 Piotr M. Hajac , Oskar M. Stachowiak

This is part of an ongoing project to find a general algebraic framework for semiring theory. The structure theory of semirings is quite challenging, largely because of the lack of negation, and such basic properties such as unique…

Rings and Algebras · Mathematics 2026-03-30 Marianne Akian , Stephane Gaubert , Louis Rowen

We consider the set of alternating paths on a fixed fully packed loop of size n. This set is in bijection with the set of fully packed loops of size n. Furthermore, for a special choice of fully packed loop, we demonstrate that the set of…

Combinatorics · Mathematics 2013-01-08 Stephen Ng

In this note we apply a spectral method to the graph of alternating bilinear forms. In this way, we obtain upper bounds on the size of an alternating rank-metric code for given values of the minimum rank distance. We computationally compare…

Combinatorics · Mathematics 2024-05-16 Aida Abiad , Gianira N. Alfarano , Alberto Ravagnani

We define a new class of binary matrices by maximizing the peak-sidelobe distances in the aperiodic autocorrelations. These matrices can be used as robust position marks for in-plane spatial alignment. The optimal square matrices of…

Computer Vision and Pattern Recognition · Computer Science 2023-05-03 Scott A. Skirlo , Ling Lu , Marin Soljačić

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…

Discrete Mathematics · Computer Science 2025-09-04 Sándor Bozóki , Zsombor Szádoczki , Hailemariam Abebe Tekile

We analyze the spectral properties of correlation matrices between distinct statistical systems. Such matrices are intrinsically non symmetric, and lend themselves to extend the spectral analyses usually performed on standard Pearson…

Statistical Finance · Quantitative Finance 2012-06-29 Giacomo Livan , Luca Rebecchi

We show that there is the same number of (n,l)-alternating sign trapezoids as there is of column strict shifted plane partitions of class l-1 with at most n parts in the top row, thereby proving a result that was conjectured independently…

Combinatorics · Mathematics 2018-04-25 Ilse Fischer

Let J and J* be subsets of Z+ such that 0,1\in J and 0\in J*. For infinitely many n, let k=(k_1,..., k_n) be a vector of nonnegative integers whose sum M is even. We find an asymptotic expression for the number of multigraphs on the vertex…

Combinatorics · Mathematics 2013-09-24 Catherine Greenhill , Brendan D McKay

Denote by $A_n$ the set of square $(0,1)$ matrices of order $n$. The set $A_n$, $n\le8$, is partitioned into row/column permutation equivalence classes enabling derivation of various facts by simple counting. For example, the number of…

Combinatorics · Mathematics 2007-05-23 Miodrag Živković

Link sign prediction on a signed graph is a task to determine whether the relationship represented by an edge is positive or negative. Since the presence of negative edges violates the graph homophily assumption that adjacent nodes are…

Machine Learning · Computer Science 2026-03-06 Jinkyu Sung , Myunggeum Jee , Joonseok Lee

We study extremal type problem arising from the question: What is the maximum number of edge-disjoint non-crossing perfect matchings on a set S of 2n points in the plane such that their union is a triangle-free geometric graph? We approach…

Combinatorics · Mathematics 2017-09-14 Hazim Michman Trao , Gek L. Chia , Niran Abbas Ali , Adem Kilicman

It was shown recently by the authors that, for any n, there is equality between the distributions of certain triplets of statistics on nxn alternating sign matrices (ASMs) and descending plane partitions (DPPs) with each part at most n. The…

Combinatorics · Mathematics 2012-10-16 Roger E. Behrend , Philippe Di Francesco , Paul Zinn-Justin

A factorization of an $n \times n$ nonnegative symmetric matrix $A$ of the form $BCB^T$, where $C$ is a $k \times k$ symmetric matrix, and both $B$ and $C$ are required to be nonnegative, is called the Symmetric Nonnegative Matrix…

Combinatorics · Mathematics 2024-11-14 Damjana Kokol Bukovšek , Helena Šmigoc

A sign pattern is a matrix that has entries from the set $\{+,-,0\}$. An $n\times n$ sign pattern $\mathcal{P}$ is called consistent if every real matrix in its qualitative class has exactly $k$ real eigenvalues and $n-k$ nonreal…

Combinatorics · Mathematics 2026-01-01 Partha Rana , Sriparna Bandopadhyay

We study aperiodic systems based on substitution rules by means of a transfer-matrix approach. In addition to the well-known trace map, we investigate the so-called `antitrace' map, which is the corresponding map for the difference of the…

Disordered Systems and Neural Networks · Physics 2007-05-23 Xiaoguang Wang , Uwe Grimm , Michael Schreiber

In this paper, we study two examples of minimum weight random graphs with edge constraints. First we consider the complete graph on ${n}$ vertices equipped with uniformly heavy edge weights and use iteration methods to obtain deviation…

Probability · Mathematics 2023-01-13 Ghurumuruhan Ganesan
‹ Prev 1 8 9 10 Next ›