English
Related papers

Related papers: Off-diagonally symmetric alternating sign matrices

200 papers

We show that if a list of nonzero complex numbers $\sigma=(\lambda_1,\lambda_2,\ldots,\lambda_k)$ is the nonzero spectrum of a diagonalizable nonnegative matrix, then $\sigma$ is the nonzero spectrum of a diagonalizable nonnegative matrix…

Spectral Theory · Mathematics 2018-05-18 Thomas J. Laffey , Helena Šmigoc

We present counterexamples to the lore that symmetries that cannot be gauged or made on-site are necessarily anomalous. Specifically, we construct unitary, internal symmetries of two-dimensional lattice models that cannot be consistently…

Strongly Correlated Electrons · Physics 2025-07-30 Wilbur Shirley , Carolyn Zhang , Wenjie Ji , Michael Levin

The iterative method of Sinkhorn allows, starting from an arbitrary real matrix with non-negative entries, to find a so-called 'scaled matrix' which is doubly stochastic, i.e. a matrix with all entries in the interval (0, 1) and with all…

Mathematical Physics · Physics 2015-02-09 Alexis De Vos , Stijn De Baerdemacker

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

An oblivious subspace embedding (OSE), characterized by parameters $m,n,d,\epsilon,\delta$, is a random matrix $\Pi\in \mathbb{R}^{m\times n}$ such that for any $d$-dimensional subspace $T\subseteq \mathbb{R}^n$, $\Pr_\Pi[\forall x\in T,…

Data Structures and Algorithms · Computer Science 2021-12-22 Yi Li , Mingmou Liu

We introduce a new family $\mathcal{A}_{n,k}$ of Schur positive symmetric functions, which are defined as sums over totally symmetric plane partitions. In the first part, we show that, for $k=1$, this family is equal to a multivariate…

Combinatorics · Mathematics 2022-02-01 Florian Aigner , Ilse Fischer

We prove refined enumeration results on several symmetry classes as well as related classes of alternating sign matrices with respect to classical boundary statistics, using the six-vertex model of statistical physics. More precisely, we…

Combinatorics · Mathematics 2019-06-20 Ilse Fischer , Manjil P. Saikia

In recent papers we have studied refined enumerations of alternating sign matrices with respect to a fixed set of top and bottom rows. The present paper is a first step towards extending these considerations to alternating sign matrices…

Combinatorics · Mathematics 2010-08-04 Ilse Fischer

Orthogonal minimally aliased response surface (OMARS) designs permit the study of quantitative factors at three levels using an economical number of runs. In these designs, the linear effects of the factors are neither aliased with each…

Methodology · Statistics 2025-12-22 Alan R. Vazquez , Peter Goos , Eric D. Schoen

In this note, we construct a 2-basic set of the alternating group \A_n. To do this, we construct a 2-basic set of the symmetric group \sym_n with an additional property, such that its restriction to \A_n is a 2-basic set. We adapt here a…

Representation Theory · Mathematics 2010-10-18 Olivier Brunat , Jean-Baptiste Gramain

We study the symmetric outer product decomposition which decomposes a fully (partially) symmetric tensor into a sum of rank-one fully (partially) symmetric tensors. We present iterative algorithms for the third-order partially symmetric…

Numerical Analysis · Mathematics 2013-12-31 Na Li , Carmeliza Navasca

The normal form for a system of ode's is constructed from its polynomial symmetries of the linear part of the system, which is assumed to be semi-simple. The symmetries are shown to have a simple structure such as invariant function times…

patt-sol · Physics 2009-10-28 Yuji Kodama

We demonstrate a natural bijection between a subclass of alternating sign matrices (ASMs) defined by a condition on the corresponding monotone triangle which we call the gapless condition and a subclass of totally symmetric…

Combinatorics · Mathematics 2012-08-28 Arvind Ayyer , Robert Cori , Dominique Gouyou-Beauchamps

We construct orthogonal arrays OA$_{\lambda} (k,n)$ (of strength two) having a row that is repeated $m$ times, where $m$ is as large as possible. In particular, we consider OAs where the ratio $m / \lambda$ is as large as possible; these…

Combinatorics · Mathematics 2018-12-14 Charles J. Colbourn , Douglas R. Stinson , Shannon Veitch

Given a nonnegative matrix $A$, can you find diagonal matrices $D_1,~D_2$ such that $D_1AD_2$ is doubly stochastic? The answer to this question is known as Sinkhorn's theorem. It has been proved with a wide variety of methods, each…

Rings and Algebras · Mathematics 2016-09-22 Martin Idel

We enumerate all circulant good matrices with odd orders divisible by 3 up to order 70. As a consequence of this we find a previously overlooked set of good matrices of order 27 and a new set of good matrices of order 57. We also find that…

Logic in Computer Science · Computer Science 2019-07-30 Curtis Bright , Dragomir Z. Djokovic , Ilias Kotsireas , Vijay Ganesh

For $n\ge 5$, we prove that every $n\times n$ matrix $M=(a_{i,j})$ with entries in $\{-1,1\}$ and absolute discrepancy $|\mathrm{disc}(M)|=|\sum a_{i,j}|\le n$ contains a zero-sum square except for the split matrix (up to symmetries). Here,…

Combinatorics · Mathematics 2021-06-09 Alma R. Arévalo , Amanda Montejano , Edgardo Roldán-Pensado

Let $\Gamma$ be a group of order $n^2$ and $SMS_{\Gamma}(n)=(a_{i,j})_{n\times n}$ be an $n\times n$ array whose entries are all distinct elements of $\Gamma$. If there exists an element $\mu\in\Gamma$ such that for every row $i$, there…

Combinatorics · Mathematics 2026-02-26 Sylwia Cichacz , Dalibor Froncek

The problem of determining whether a diagonally dominant matrix is singular or nonsingular is a classical topic in matrix theory. This paper develops necessary and sufficient conditions for the singularity or nonsingularity of diagonally…

Rings and Algebras · Mathematics 2025-12-02 Jidong Jin

We consider square matrices A that commute with a fixed square matrix K, both with entries in a field F not of characteristic 2. When K^2=I, Tao and Yasuda defined A to be generalized centrosymmetric with respect to K. When K^2=-I, we…

Combinatorics · Mathematics 2007-07-09 Christopher R. H. Hanusa
‹ Prev 1 3 4 5 6 7 10 Next ›