Results 31 to 40 of about 1,084 (99)
Sensitivities and block sensitivities of elementary symmetric Boolean functions
Boolean functions have important applications in molecular regulatory networks, engineering, cryptography, information technology, and computer science. Symmetric Boolean functions have received a lot of attention in several decades.
Zhang Jing, Li Yuan, Adeyeye John O.
doaj +1 more source
On an alternative sequence comparison statistic of Steele [PDF]
The purpose of this paper is to study a statistic that is used to compare the similarity between two strings, which is first introduced by Michael Steele in 1982.
Ümit Işlak, Alperen Y. Özdemir
doaj +1 more source
Recurrences for Eulerian polynomials of type B and type D [PDF]
We introduce new recurrences for the type B and type D Eulerian polynomials, and interpret them combinatorially. These recurrences are analogous to a well-known recurrence for the type A Eulerian polynomials.
Hyatt, Matthew
core +1 more source
Determinant of binary circulant matrices
This article gives a closed-form expression for the determinant of binary circulant matrices.
Hariprasad M.
doaj +1 more source
Pattern Avoiding Permutations Enumerated by Inversions [PDF]
Permutations are usually enumerated by size, but new results can be found by enumerating them by inversions instead, in which case one must restrict one's attention to indecomposable permutations.
Atli Fannar Franklín
doaj +1 more source
On differentiability of a class of orthogonally invariant functions on several operator variables
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
SIMPLEXES AND THEIR APPLICATIONS - A SHORT SURVEY
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
Long increasing subsequences and non-algebraicity [PDF]
We use a recent result of Alin Bostan to prove that the generating functions of two infinite sequences of permutation classes are not algebraic.
Miklos Bona
doaj +1 more source
Lattice Paths and Pattern-Avoiding Uniquely Sorted Permutations [PDF]
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
Applications of the Finite State Automata for Counting Restricted Permutations and Variations
: 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

