Results 11 to 20 of about 11,687 (142)
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 +5 more
wiley +1 more source
, 2019 The classical theory of symmetric functions has a central position in algebraic combinatorics, bridging aspects of representation theory, combinatorics, and enumerative geometry.
Allen Hatcher +36 more
core +1 more source
, 2010 A classic problem in enumerative combinatorics is to count the number of derangements, that is, permutations with no fixed point. Inspired by a recent generalization to facet derangements of the hypercube by Gordon and McMahon, we generalize this problem
Assaf, Sami H.
core +3 more sources
On the Structure of Bispecial Sturmian Words
, 2013 A balanced word is one in which any two factors of the same length contain the same number of each letter of the alphabet up to one. Finite binary balanced words are called Sturmian words.
Fici, Gabriele
core +1 more source
An Extension of the Exponential Formula in Enumerative Combinatorics [PDF]
The Electronic Journal of Combinatorics, 1995 Let $\alpha$ be a formal variable and $F_w$ be a weighted species of structures (class of structures closed under weight-preserving isomorphisms) of the form ${F}_{w} = E({F}_{w}^{c})$, where $E$ and $F_w^c$ respectively denote the species of sets and of connected $F_w$-structures.
Gilbert Labelle, Pierre Leroux
openaire +2 more sources
Computer Algebra in the Service of Enumerative Combinatorics [PDF]
Proceedings of the 2021 International Symposium on Symbolic and Algebraic Computation, 2021 Classifying lattice walks in restricted lattices is an important problem in enumerative combinatorics. Recently, computer algebra has been used to explore and to solve a number of difficult questions related to lattice walks. We give an overview of recent results on structural properties (e.g., algebraicity versus transcendence) and on explicit ...
openaire +2 more sources
On Kotzig's Perfect Set Problem of Hamiltonian Cycle Decompositions of the Complete Graph
Journal of Combinatorial Designs, EarlyView.ABSTRACT A Hamiltonian cycle decomposition (HCD) of K n ${K}_{n}$ is a set of Hamiltonian cycles in which each 1‐path of K n ${K}_{n}$ appears exactly once. A Dudeney set of K n ${K}_{n}$ is a set of Hamiltonian cycles in which each 2‐path of K n ${K}_{n}$ appears exactly once.
Nobuaki Mutoh
wiley +1 more source
Transitive factorizations of permutations and geometry [PDF]
, 2014 We give an account of our work on transitive factorizations of permutations. The work has had impact upon other areas of mathematics such as the enumeration of graph embeddings, random matrices, branched covers, and the moduli spaces of curves.
Goulden, I. P., Jackson, D. M.
core
Unimodality Problems in Ehrhart Theory
, 2017 Ehrhart theory is the study of sequences recording the number of integer points in non-negative integral dilates of rational polytopes. For a given lattice polytope, this sequence is encoded in a finite vector called the Ehrhart $h^*$-vector. Ehrhart $h^*
A. Stapledon +45 more
core +1 more source
On Strongly and Robustly Critical Graphs
Journal of Graph Theory, EarlyView.ABSTRACT In extremal combinatorics, it is common to focus on structures that are minimal with respect to a certain property. In particular, critical and list‐critical graphs occupy a prominent place in graph coloring theory. Stiebitz, Tuza, and Voigt introduced strongly critical graphs, i.e., graphs that are k $k$‐critical yet L $L$‐colorable with ...
Anton Bernshteyn +3 more
wiley +1 more source