Results 21 to 30 of about 70,835 (229)
On shortening u-cycles and u-words for permutations [PDF]
Discrete Applied Mathematics, 2017 This paper initiates the study of shortening universal cycles (u-cycles) and universal words (u-words) for permutations either by using incomparable elements, or by using non-deterministic symbols.
S. Kitaev, V. Potapov, V. Vajnovszki
semanticscholar +1 more source
Combinatorial Hopf algebra structure on packed square matrices [PDF]
, 2015 We construct a new bigraded Hopf algebra whose bases are indexed by square matrices with entries in the alphabet $\{0, 1, ..., k\}$, $k \geq 1$, without null rows or columns.
Cheballah, Hayat +2 more
core +5 more sources
Decomposing labeled interval orders as pairs of permutations [PDF]
, 2014 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.
Claesson, Anders, Hannah, Stuart A.
core +3 more sources
, 2016 Background/Objectives: Salsa and ChaCha are commonly used encryption primitives. Both Salsa and ChaCha core use Quarter round as its core function. The objective of the paper is to analyze the diffusion property of Quarter round of both these algorithms ...
R. Sobti, Geetha Ganesan
semanticscholar +1 more source
Asymptotic free independence and entry permutations for Gaussian random matrices [PDF]
, 2018 The paper presents conditions on entry permutations that induce asymptotic freeness when acting on Gaussian random matrices. The class of permutations described includes the matrix transpose, as well as entry permutations relevant in Quantum Information ...
M. Popa
semanticscholar +1 more source
Cycles of free words in several independent random permutations with restricted cycle lengths [PDF]
, 2010 In this text, we consider random permutations which can be written as free words in several independent random permutations: firstly, we fix a non trivial word $w$ in letters $g_1,g_1^{-1},..., g_k,g_k^{-1}$, secondly, for all $n$, we introduce a $k ...
Benaych-Georges, Florent
core +5 more sources
LP-decodable multipermutation codes
, 2014 In this paper, we introduce a new way of constructing and decoding multipermutation codes. Multipermutations are permutations of a multiset that may consist of duplicate entries. We first introduce a new class of matrices called multipermutation matrices.
Draper, Stark C., Liu, Xishuo
core +2 more sources
On partial well-order for monotone grid classes of permutations [PDF]
, 2010 A monotone grid class is a permutation class (i.e., a downset of permutations under the containment order) defined by local monotonicity conditions. We give a simplified proof of a result of Murphy and Vatter that monotone grid classes of forests are ...
Vatter, Vincent, Waton, Steve
core +2 more sources
, 2012 We extend the notion of consecutive pattern avoidance to considering sums over all permutations where each term is a product of weights depending on each consecutive pattern of a fixed length. We study the problem of finding the asymptotics of these sums.
Ehrenborg, Richard, Jung, JiYoon
core +1 more source
On the minimum output entropy of random orthogonal quantum channels
, 2017 We consider sequences of random quantum channels defined using the Stinespring formula with Haar-distributed random orthogonal matrices. For any fixed sequence of input states, we study the asymptotic eigenvalue distribution of the outputs through tensor
Fukuda, Motohisa, Nechita, Ion
core +3 more sources