English
Related papers

Related papers: Permutation-Like Matrices

200 papers

In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…

Combinatorics · Mathematics 2016-11-01 Franck Gabriel

State symmetries are defined as permutations which act on vector spaces of column vectors and square matrices, resulting in isotropy groups for specific vector spaces. A large number of properties for such objects is shown, to provide a…

Rings and Algebras · Mathematics 2007-05-23 Arne Ring

A D-permutation is a permutation of $[2n]$ satisfying $2k-1 \le \sigma(2k-1)$ and $2k \ge \sigma(2k)$ for all $k$; they provide a combinatorial model for the Genocchi and median Genocchi numbers. We find Stieltjes-type and Thron-type…

Combinatorics · Mathematics 2022-12-15 Bishal Deb , Alan D. Sokal

This dissertation presents a multifaceted look into the structural decomposition of permutation classes. The theory of permutation patterns is a rich and varied field, and is a prime example of how an accessible and intuitive definition…

Combinatorics · Mathematics 2014-10-13 Cheyne Homberger

A square matrix of order n with $n\geq 2$ is called permutative matrix when all its rows (up to the frst one) are permutations of precisely its frst row. In this paper recalling spectral results for partitioned into $2$-by-$2$ symmetric…

Spectral Theory · Mathematics 2017-08-29 Cristina B. Manzaneda , Enide Andrade , María Robbiano

The algebra of invariants of d-tuples of n x n skew-symmetric matrices under the action of the orthogonal group by simultaneous conjugation is considered over an infinite field of characteristic different from two. For n=3 and d>0 a minimal…

Representation Theory · Mathematics 2012-07-24 A. A. Lopatin

We study the spectrum of an asymmetric random matrix with block structured variances. The rows and columns of the random square matrix are divided into $D$ partitions with arbitrary size (linear in $N$). The parameters of the model are the…

Probability · Mathematics 2015-10-28 Johnatan Aljadeff , David Renfrew , Merav Stern

We present a class of symplectic matrices which transform by similarity given $2n\times 2n$ -dimensional matrix into Bunse-Gerstner form. If the given matrix is skew-Hamiltonian, the transformation gives a solution of an antisymmetric…

Rings and Algebras · Mathematics 2007-05-23 J. Stefanovski , K. Trencevski

We introduce certain torus-equivariant classes on permutohedral varieties which we call "tautological classes of matroids" as a new geometric framework for studying matroids. Using this framework, we unify and extend many recent…

Combinatorics · Mathematics 2023-04-17 Andrew Berget , Christopher Eur , Hunter Spink , Dennis Tseng

We introduce ballot matrices, a signed combinatorial structure whose definition naturally follows from the generating function for labeled interval orders. A sign reversing involution on ballot matrices is defined. We show that matrices…

Combinatorics · Mathematics 2014-10-22 Anders Claesson , Stuart A. Hannah

Consider S_n, the symmetric group on n letters, and let maj pi denote the major index of a permutation pi in S_n. Given positive integers k,l and nonnegative integers i,j, define m_n^{k,l}(i,j) := number of pi in S_n such that maj pi = i…

Combinatorics · Mathematics 2007-05-23 Helene Barcelo , Bruce Sagan , Sheila Sundaram

When two patterns occur equally often in a set of permutations, we say that these patterns are equipopular. Using both structural and analytic tools, we classify the equipopular patterns in the set of separable permutations. In particular,…

Combinatorics · Mathematics 2014-10-28 Michael Albert , Cheyne Homberger , Jay Pantone

In this paper, we look at the number of factorizations of a given permutation into star transpositions. In particular, we give a natural explanation of a hidden symmetry, answering a question of I.P. Goulden and D.M. Jackson. We also have a…

Combinatorics · Mathematics 2013-01-09 Valentin Feray

Matrices are the most common representations of graphs. They are also used for the representation of algebras and cluster algebras. This paper shows some properties of matrices in order to facilitate the understanding and locating…

Discrete Mathematics · Computer Science 2015-03-12 Elisângela Silva Dias , Diane Castonguay , Mitre Costa Dourado

A permutation on an alphabet $ \Sigma $, is a sequence where every element in $ \Sigma $ occurs precisely once. Given a permutation $ \pi $= ($\pi_{1} $, $ \pi_{2} $, $ \pi_{3} $,....., $ \pi_{n} $) over the alphabet $ \Sigma $ =$\{ $0, 1,…

Discrete Mathematics · Computer Science 2016-01-19 Bhadrachalam Chitturi , Krishnaveni K S

In this paper we consider permutations of sequences of partitions, obtaining a result which parallels von Neumann's theorem on permutations of dense sequences and uniformly distributed sequences of points.

Functional Analysis · Mathematics 2009-02-12 Ingrid Carbone , Aljosa Volcic

The X-ray of a permutation is defined as the sequence of antidiagonal sums in the associated permutation matrix. X-rays of permutation are interesting in the context of Discrete Tomography since many types of integral matrices can be…

Combinatorics · Mathematics 2007-05-23 Cecilia Bebeacua , Toufik Mansour , Alexander Postnikov , Simone Severini

Alternating sign matrices and totally symmetric self-complementary plane partitions are equinumerous sets of objects for which no explicit bijection is known. In this paper, we identify a subset of totally symmetric self-complementary plane…

Combinatorics · Mathematics 2019-05-22 Jessica Striker

A $d$-dimensional matrix is called \emph{$1$-polystochastic} if it is non-negative and the sum over each line equals~$1$. Such a matrix that has a single $1$ in each line and zeros elsewhere is called a \emph{$1$-permutation} matrix. A…

Combinatorics · Mathematics 2020-04-30 Billy Child , Ian M. Wanless

We say that a Euclidean lattice in $\mathbb R^n$ is permutation invariant if its automorphism group has non-trivial intersection with the symmetric group $S_n$, i.e., if the lattice is closed under the action of some non-identity elements…

Combinatorics · Mathematics 2017-09-04 Lenny Fukshansky , Stephan Ramon Garcia , Xun Sun
‹ Prev 1 3 4 5 6 7 10 Next ›