Results 1 to 10 of about 17,413 (115)
Pattern avoidance in forests of binary shrubs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 We investigate pattern avoidance in permutations satisfying some additional restrictions. These are naturally considered in terms of avoiding patterns in linear extensions of certain forest-like partially ordered sets, which we call binary shrub forests.
David Bevan +6 more
doaj +7 more sources
Arrangements Of Minors In The Positive Grassmannian And a Triangulation of The Hypersimplex [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 The structure of zero and nonzero minors in the Grassmannian leads to rich combinatorics of matroids. In this paper, we investigate an even richer structure of possible equalities and inequalities between the minors in the positive Grassmannian.
Miriam Farber, Yelena Mandelshtam
doaj +7 more sources
Topics in Cognitive Science, EarlyView., 2023 Abstract Over the past several decades, research in the cognitive sciences has foregrounded the importance of active bodies and their continuous dependence on the changing environment, strengthening the relevance of dynamical models. These models have been steadily developed within the ecological psychology approach to cognition, which arguably ...
Joanna Rączaszek‐Leonardi
wiley +1 more source
Angewandte Chemie, EarlyView.Pareto optimal compositions of alloy catalyst for oxygen reduction reaction are uncovered through multi‐objective Bayesian optimization of activity, stability, and material cost in an eight‐element high‐entropy alloy composition space. The substantial Pareto front obtained is compared to experimental literature and analyzed to elucidate the roles and ...
Mads K. Plenge +4 more
wiley +2 more sources
Nonlocal, noncommutative diagrammatics and the linked cluster Theorems [PDF]
, 2011 Recent developments in quantum chemistry, perturbative quantum field theory, statistical physics or stochastic differential equations require the introduction of new families of Feynman-type diagrams. These new families arise in various ways.
Brouder, Christian, Frédéric, Patras
core +3 more sources
The short toric polynomial [PDF]
, 2011 We introduce the short toric polynomial associated to a graded Eulerian poset. This polynomial contains the same information as the two toric polynomials introduced by Stanley, but allows different algebraic manipulations.
Hetyei, Gábor
core +4 more sources
SPERNER THEOREMS FOR UNRELATED COPIES OF POSETS AND GENERATING DISTRIBUTIVE LATTICES
Ural Mathematical JournalFor a finite poset (partially ordered set) \(U\) and a natural number \(n\), let \(S(U,n)\) denote the largest number of pairwise unrelated copies of \(U\) in the powerset lattice (AKA subset lattice) of an \(n\)-element set.
Gábor Czédli
doaj +1 more source
On the heapability of finite partial orders
, 2020 We investigate the partitioning of partial orders into a minimal number of heapable subsets. We prove a characterization result reminiscent of the proof of Dilworth's theorem, which yields as a byproduct a flow-based algorithm for computing such a ...
Balogh, János +4 more
core +1 more source
Antichain cutsets of strongly connected posets
, 2012 Rival and Zaguia showed that the antichain cutsets of a finite Boolean lattice are exactly the level sets. We show that a similar characterization of antichain cutsets holds for any strongly connected poset of locally finite height.
A Aramova +20 more
core +1 more source
D-log and formal flow for analytic isomorphisms of n-space [PDF]
, 2002 Given a formal map $F=(F_1...,F_n)$ of the form $z+\text{higher}$ order terms, we give tree expansion formulas and associated algorithms for the D-Log of F and the formal flow F_t.
Wright, David, Zhao, Wenhua
core +2 more sources