Results 41 to 50 of about 159 (130)
Sensitivities and block sensitivities of elementary symmetric Boolean functions
Journal of Mathematical Cryptology, 2021 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
Monotone subsets in lattices and the Schensted shape of a Sós permutation [PDF]
, 2022 For a fixed irrational number \(\alpha\) and \(n\in \mathbb{N}\), we look at the shape of the sequence \((f(1),\ldots,f(n))\) after Schensted insertion, where \(f(i) = \alpha i \mod 1\).
Liechty, Karl, Petersen, T. Kyle
core +1 more source
On Iteration of Bijective Functions with Discontinuities
Annales Mathematicae Silesianae, 2020 We present three different types of bijective functions f : I → I on a compact interval I with finitely many discontinuities where certain iterates of these functions will be continuous.
Fripertinger Harald
doaj +1 more source
A Symmetric Function of Increasing Forests
Forum of Mathematics, Sigma, 2021 For an indifference graph G, we define a symmetric function of increasing spanning forests of G. We prove that this symmetric function satisfies certain linear relations, which are also satisfied by the chromatic quasisymmetric function and unicellular $\
Alex Abreu, Antonio Nigro
doaj +1 more source
The combinatorics of a tree-like functional equation for connected chord diagrams [PDF]
, 2023 We build on recent work of Yeats, Courtiel, and others involving connected chord diagrams. We first derive from a Hopf-algebraic foundation a class of tree-like functional equations and prove that they are solved by weighted generating functions of two ...
Nabergall, Lukas
core +1 more source
Two examples of Wilf-collapse [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 Two permutation classes, the X-class and subpermutations of the increasing oscillation are shown to exhibit an exponential Wilf-collapse. This means that the number of distinct enumerations of principal subclasses of each of these classes grows much more
Michael Albert +2 more
doaj +1 more source
Toppleable permutations, excedances and acyclic orientations [PDF]
, 2022 Recall that an excedance of a permutation \(\pi\) is any position \(i\) such that \(\pi_i > i\). Inspired by the work of Hopkins, McConville and Propp (Elec. J. Comb., 2017) on sorting using toppling, we say that a permutation is toppleable if it gets
Hathcock, Daniel +2 more
core +1 more source
On an alternative sequence comparison statistic of Steele [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 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
Grass(mannian) trees and forests: Variations of the exponential formula, with applications to the momentum amplituhedron [PDF]
, 2023 The Exponential Formula allows one to enumerate any class of combinatorial objects built by choosing a set of connected components and placing a structure on each connected component which depends only on its size.
Moerman, Robert, Williams, Lauren K.
core +1 more source
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