Results 31 to 40 of about 143 (87)
Determinant of binary circulant matrices
Special Matrices, 2019 This article gives a closed-form expression for the determinant of binary circulant matrices.
Hariprasad M.
doaj +1 more source
Lattice Paths and Pattern-Avoiding Uniquely Sorted Permutations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 Defant, Engen, and Miller defined a permutation to be uniquely sorted if it has exactly one preimage under West's stack-sorting map. We enumerate classes of uniquely sorted permutations that avoid a pattern of length three and a pattern of length four by
Hanna Mularczyk
doaj +1 more source
On differentiability of a class of orthogonally invariant functions on several operator variables
, 2018 In this work, we study a connection between two classes of orthogonally invariant functions. Both types of functions are defined on Sn1 × . . .× Snk . The functions in the first class take their values in Sn1 ···nk , while those in the second take values
T. Jiang, Hristo S. Sendov
semanticscholar +1 more source
Equivalence classes of mesh patterns with a dominating pattern [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 Two mesh patterns are coincident if they are avoided by the same set of permutations, and are Wilf-equivalent if they have the same number of avoiders of each length.
Murray Tannock, Henning Ulfarsson
doaj +1 more source
Patterns in Inversion Sequences I [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 Permutations that avoid given patterns have been studied in great depth for their connections to other fields of mathematics, computer science, and biology.
Sylvie Corteel +3 more
doaj +1 more source
SIMPLEXES AND THEIR APPLICATIONS - A SHORT SURVEY
, 2013 We investigate different types of simplexes (linear algebraic, affine, geometric), solve some extremal problems and state general conjectures concerning these notions in discrete geo- metry and matroid theory, finally present some applications in ...
Azs Szalkai, Istv, R. February
semanticscholar +1 more source
Bounded affine permutations I. Pattern avoidance and enumeration [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 We introduce a new boundedness condition for affine permutations, motivated by the fruitful concept of periodic boundary conditions in statistical physics. We study pattern avoidance in bounded affine permutations.
Neal Madras, Justin M. Troyka
doaj +1 more source
Applications of the Finite State Automata for Counting Restricted Permutations and Variations
, 2012 : In this paper, we use the finite state automata to count the number of restricted permutations and the number of restricted variations. For each type of restricted permutations, we construct a finite state automaton able to recognize and enumerate them.
V. Baltic
semanticscholar +1 more source
Snow Leopard Permutations and Their Even and Odd Threads [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 Caffrey, Egge, Michel, Rubin and Ver Steegh recently introduced snow leopard permutations, which are the anti-Baxter permutations that are compatible with the doubly alternating Baxter permutations. Among other things, they showed that these permutations
Eric S. Egge, Kailee Rubin
doaj +1 more source
ORDER MATTERS WHEN CHOOSING SETS
, 2011 Given natural numbers t, w and v we show, using high school algebra, that if 1 ≤ w ≤ t < v then ((v ch t) ch w) ≤ ((v ch w) ch t). Here we denote “n choose r” by (n ch r). AMS (2002) subject classification: Primary 05A20; Secondary 05A05, 94A60.
W. Moors, Julia Novak
semanticscholar +1 more source