Results 1 to 10 of about 352 (164)

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, Derek Levin, Peter Nugent, Jay Pantone, Lara Pudwell, Manda Riehl, ML Tlachac   +6 more
doaj   +1 more source

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   +1 more source

What Dynamic Approaches Have Taught Us About Cognition and What They Have Not: On Values in Motion and the Importance of Replicable Forms

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

SPERNER THEOREMS FOR UNRELATED COPIES OF POSETS AND GENERATING DISTRIBUTIVE LATTICES

Ural Mathematical Journal
For 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

Interpretability and Representability of Commutative Algebra, Algebraic Topology, and Topological Spectral Theory for Real‐World Data

Advanced Intelligent Discovery, EarlyView.
This article investigates how persistent homology, persistent Laplacians, and persistent commutative algebra reveal complementary geometric, topological, and algebraic invariants or signatures of real‐world data. By analyzing shapes, synthetic complexes, fullerenes, and biomolecules, the article shows how these mathematical frameworks enhance ...
Yiming Ren, Guo‐Wei Wei
wiley   +1 more source

The power of many: when genetics met yeasts and high‐throughput

Biological Reviews, EarlyView.
ABSTRACT In recent years, complex technological capabilities have evolved, driven by the need to solve complex and integrative biological questions through global analyses. New equipment allows the scaling up and automation of processes which previously were carried out on a very limited scale.
Víctor A. Tallada, Víctor Carranco
wiley   +1 more source

Utterance evolution: the road to generative, combinatorial communicators

Biological Reviews, EarlyView.
ABSTRACT Language has long been considered uniquely complex in the animal kingdom; however, animal research over the last decade has begun to challenge some long‐standing premises about exactly which language capacities are uniquely human. The task of resolving why and how complex communication systems evolve, particularly human language, has ...
Catherine Crockford, Roman Martin Wittig, Cedric Girard‐Buttoz   +2 more
wiley   +1 more source

What Constitutes an Attractive Product‐as‐a‐Service Offer? Examining Consumer Preferences for (Circular) Business Patterns

Business Strategy and the Environment, EarlyView.
ABSTRACT Little is known about consumer preferences for combinations of circular business model patterns, despite their potential to benefit the design of product services. This study examines consumer preferences for product‐as‐a‐service offers, combined with circular product attributes, across Sweden and the Netherlands.
Steven Sarasini, Aemiro Melkamu Daniel, Katherine Whalen, Nancy Bocken, Agnieszka Hunka, Tarlan Ahmadov   +5 more
wiley   +1 more source

Colourings of Uniform Group Divisible Designs and Maximum Packings

Journal of Combinatorial Designs, EarlyView.
ABSTRACT A weak c $c$‐colouring of a design is an assignment of colours to its points from a set of c $c$ available colours, such that there are no monochromatic blocks. A colouring of a design is block‐equitable, if for each block, the number of points coloured with any available pair of colours differ by at most one.
Andrea C. Burgess, Peter Danziger, Diane Donovan, Tara Kemp, James G. Lefevre, David A. Pike, E. Şule Yazıcı   +6 more
wiley   +1 more source

Orientations of Graphs With at Most One Directed Path Between Every Pair of Vertices

Journal of Graph Theory, EarlyView.
ABSTRACT Given a graph G $G$, we say that an orientation D $D$ of G $G$ is a KT orientation if, for all u , v ∈ V ( D ) $u,v\in V(D)$, there is at most one directed path (in any direction) between u $u$ and v $v$. Graphs that admit such orientations have been used to construct graphs with large chromatic number and small clique number that served as ...
Barbora Dohnalová, Jiří Kalvoda, Gaurav Kucheriya, Sophie Spirkl   +3 more
wiley   +1 more source