Results 21 to 30 of about 162,256 (241)
Enumerative combinatorics, representations and quasisymmetric functions
, 2022 Η παρούσα διατριβή αποτελείται ουσιαστικά από δυο μέρη με κύριο πρωταγωνιστή τις χρωματισμένες quasi-συμμετρικές συναρτήσεις. Το 1984 ο Gessel εισήγαγε τις quasi-συμμετρικές συναρτήσεις, μια γενίκευση των συμμετρικών συναρτήσεων. Έπειτα, το 1993, μαζί με τον Reutenauer μελέτησαν εκτιμήσεις διάφορων quasi-συμμετρικών συναρτήσεων που σχετίζονται με ...
Βασίλειος-Διονύσιος Μουστάκας
openaire +3 more sources
Duality of codes supported on regular lattices, with an application to enumerative combinatorics [PDF]
Designs, Codes and Cryptography, 2017 We introduce a general class of regular weight functions on finite abelian groups, and study the combinatorics, the duality theory, and the metric properties of codes endowed with such functions.
Alberto Ravagnani
openalex +3 more sources
THE (△,□)-EDGE GRAPH G△,□ OF A GRAPH G [PDF]
Journal of Algebraic Systems, 2020 To a simple graph $G=(V,E)$, we correspond a simple graph $G_{\triangle,\square}$ whose vertex set is $\{\{x,y\}: x,y\in V\}$ and two vertices $\{x,y\},\{z,w\}\in G_{\triangle,\square}$ are adjacent if and only if $\{x,z\},\{x,w\},\{y,z\},\{y,w\}\in V ...
Gh. A. Nasiriboroujeni +2 more
doaj +1 more source
Enumeration of Graded (3 + 1)-Avoiding Posets [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 The notion of (3+1)-avoidance appears in many places in enumerative combinatorics, but the natural goal of enumerating all (3+1)-avoiding posets remains open. In this paper, we enumerate \emphgraded (3+1)-avoiding posets.
Joel Lewis Brewster, Yan X Zhang
doaj +1 more source
Tests and Proofs for Enumerative Combinatorics
TAP@STAF, 2016 Catherine Dubois +2 more
openalex +3 more sources
Note on r-central Lah numbers and r-central Lah-Bell numbers
AIMS Mathematics, 2022 The r-Lah numbers generalize the Lah numbers to the r-Stirling numbers in the same sense. The Stirling numbers and the central factorial numbers are one of the important tools in enumerative combinatorics. The r-Lah number counts the number of partitions
Hye Kyung Kim
doaj +1 more source
Total positivity for cominuscule Grassmannians [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 In this paper we explore the combinatorics of the non-negative part $(G/P)_{\geq 0}$ of a cominuscule Grassmannian. For each such Grassmannian we define Le-diagrams ― certain fillings of generalized Young diagrams which are in bijection with the cells of
Thomas Lam, Lauren Williams
doaj +1 more source
Congruence for Lattice Path Models with Filter Restrictions and Long Steps
Mathematics, 2022 We derive a path counting formula for a two-dimensional lattice path model with filter restrictions in the presence of long steps, source and target points of which are situated near the filters. This solves the problem of finding an explicit formula for
Dmitry Solovyev
doaj +1 more source
Urn Sampling Without Replacement: Enumerative Combinatorics in R
Journal of Statistical Software, 2007 This short paper introduces a code snippet in the form of two new R functions that enumerate possible draws from an urn without replacement; these functions call C code, written by the author.
Robin K. S. Hankin
doaj +1 more source
A Didactic Analysis of Functional Queues
Informatics in Education, 2011 When first introduced to the analysis of algorithms, students are taught how to assess the best and worst cases, whereas the mean and amortized costs are considered advanced topics, usually saved for graduates.
Christian RINDERKNECHT
doaj +1 more source