Results 21 to 30 of about 776 (182)
Computer Algebra in the Service of Enumerative Combinatorics
, 2021 International audienceClassifying 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.
Bostan, Alin, Alin Bostan
core +1 more source
Mathematics, 2018 In this paper, we justify by the use of Enumerative Combinatorics, the applicability of an asymptotic stability result on Discrete-Time Epidemics in Complex Networks, where the complex dynamics of an epidemic model to identify the nodes that contribute ...
Carlos Rodríguez Lucatero +1 more
doaj +1 more source
Bayer noise quasisymmetric functions and some combinatorial algebraic structures [PDF]
Categories and General Algebraic Structures with ApplicationsRecently, quasisymmetric functions have been widely studied due to their big connection to enumerative combinatorics, combinatorial Hopf algebra and number theory.
Adnan Abdulwahid
doaj +1 more source
Tangency quantum cohomology and characteristic numbers
Anais da Academia Brasileira de Ciências, 2001 This work establishes a connection between gravitational quantum cohomology and enumerative geometry of rational curves (in a projective homogeneous variety) subject to conditions of infinitesimal nature like, for example, tangency.
JOACHIM KOCK
doaj +1 more source
Enumerative combinatorics, continued fractions and total positivity [PDF]
, 2023 Determining whether a given number is positive is a fundamental question in mathematics. This can sometimes be answered by showing that the number counts some collection of objects, and hence, must be positive.
Deb, Bishal
core
COMBINATORIAL ANALYSIS OF THE DOMINOES SCHEME AND THE CASE OF FIXED MINIMAL FIGURE ON A DOMINO TILE
Transactions of the Karelian Research Centre of the Russian Academy of Sciences, 2017 The dominoes scheme is defined as a scheme of random tiling with poliomino tiles with $r$ ends and $n$ figures from 0 to $(n-1)$ on the ends of tiles of all possible compositions with repetitions, regardless of their order.
Natalia Enatskaya
doaj +1 more source
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
Coinductive counting: bisimulation in enumerative combinatorics (Extended Abstract) [PDF]
, 2001 The recently developed coinductive calculus of streams finds here a further application in enumerative combinatorics. A general methodology is developed to solve a wide variety of basic counting problems in a uniform way: (1) the objects to be counted ...
Rutten, J.J.M.M. +3 more
core +1 more source
Journal of Graph Theory, EarlyView.ABSTRACT In an effort to understand the complexity of the maximum independent set problem, Chvátal introduced t‐perfect graphs. While a full characterization of this class remains open, important progress has been made for claw‐free graphs [Bruhn and Stein, Math. Program. 2012] and P 5 ${P}_{5}$‐free graphs [Bruhn and Fuchs, SIAM J. Discrete Math. 2017]
Yixin Cao, Shenghua Wang
wiley +1 more source
DiskScissors: Cutting Arbitrary‐Topology Solids for Bijective Mapping
Computer Graphics Forum, EarlyView.Abstract An algorithm for cutting solid objects in a topology‐controlled manner is presented. Concretely, given a loop on the object boundary, a disk‐topology cut surface bounded by the loop is constructed in the interior. In contrast to various previous approaches, both disk topology and conformance to the prescribed loop are ensured by construction ...
S. Hinderink, M. Campen
wiley +1 more source