Enumerations on bargraphs
From MaRDI portal
Recommendations
Cites work
- A bijection between bargraphs and Dyck paths
- A method for the enumeration of various classes of column-convex polygons
- A new way of counting the column-convex polyominoes by perimeter
- A perimeter enumeration of column-convex polyominoes
- A Procedure for Improving the Upper Bound for the Number of n-Ominoes
- Algebraic languages and polyominoes enumeration
- An object grammar for column-convex polyominoes
- Analytic combinatorics
- Average site perimeter of directed animals on the two-dimensional lattices
- Bargraph statistics on words and set partitions
- Bargraphs in bargraphs
- Bijective proofs of some classical partition identities
- scientific article; zbMATH DE number 7090168
- Capacity of words
- Circular bargraphs
- Combinatorial parameters in bargraphs
- Combinatorial parameters on bargraphs of permutations
- Combinatorial Problems Suggested by the Statistical Mechanics of Domains and of Rubber-Like Molecules
- Combinatorics of Compositions and Words
- Combinatorics of permutations
- Combinatorics of set partitions
- Commutation relations, normal ordering, and Stirling numbers
- Computational science -- ICCS 2003. International conference, Melbourne, Australia and St. Petersburg, Russia, June 2--4, 2003. Proceedings, Part III.
- Counting 1 2 rectangles in set partitions
- Counting corners in compositions and set partitions presented as bargraphs
- Counting corners in partitions
- Counting polyominoes: yet another attack
- Counting staircases in integer compositions
- Counting water cells in bargraphs of compositions and set partitions
- Critical exponents from nonlinear functional equations for partially directed cluster models
- Durfee squares in compositions
- Effect of stiffness on the pulling of an adsorbing polymer from a wall: an exact solution of a partially directed walk model
- Engel's inequality for Bell numbers
- Enumerating 2D percolation series by the finite-lattice method: theory
- Enumerations of lattice animals and trees
- Enumeriation of parallelogram polyominoes with given bond and site perimeter
- Exact solution of the discrete \((1+1)\)-dimensional SOS model with field and surface interactions
- Exact solution of the staircase and row-convex polygon perimeter and area generating function
- Exactly solved models
- Exchange symmetries in Motzkin path and bargraph models of copolymer adsorption
- Generating functions for column-convex polyominoes
- scientific article; zbMATH DE number 2126631 (Why is no real title available?)
- scientific article; zbMATH DE number 48688 (Why is no real title available?)
- scientific article; zbMATH DE number 3577263 (Why is no real title available?)
- scientific article; zbMATH DE number 687006 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- scientific article; zbMATH DE number 195103 (Why is no real title available?)
- scientific article; zbMATH DE number 897152 (Why is no real title available?)
- scientific article; zbMATH DE number 7362651 (Why is no real title available?)
- Identically distributed pairs of partition statistics
- Interior vertices in set partitions
- Levels in bargraphs
- Nonintersecting lattice paths on the cylinder
- On the general zeroth-order Randić index of bargraphs
- Perimeter generating function for row-convex polygons on the rectangular lattice
- Polygons, polyominoes and polycubes
- Protected cells in bargraphs
- Rationality, irrationality, and Wilf equivalence in generalized factor order
- Restricted integer partition functions
- Shedding light on words
- Skew Dyck paths, area, and superdiagonal bargraphs
- Statistics of collapsing lattice animals
- Statistics of lattice animals (polyominoes) and polygons
- Statistics on bargraphs viewed as cornerless Motzkin paths
- The arithmetic of partitions into distinct parts
- The height and width of bargraphs
- The number of three-choice polygons
- The perimeter and site-perimeter of set partitions
- The perimeter of 2-compositions
- The perimeter of words
- The site-perimeter of bargraphs
- The site-perimeter of permutations
- The water capacity of integer compositions
- Three-letter-pattern avoiding permutations and functional equations
- Two Theorems of Euler and a General Partition Theorem
- Walls in bargraphs
Cited in
(38)- A bijection between bargraphs and Dyck paths
- Circular bargraphs
- Counting lattice points on bargraphs of Catalan words
- Variation statistics on compositions
- Counting corners in compositions and set partitions presented as bargraphs
- \(t\)-bargraphs and \(t\)-compositions
- Enumerations of bargraphs with respect to corner statistics
- Visibility in pattern-restricted permutations
- Visibility in non-crossing and non-nesting partitions
- Counting permutations by the number of vertical edges in their bargraphs
- Counting minimal edges in bargraphs
- scientific article; zbMATH DE number 7471114 (Why is no real title available?)
- Combinations as bargraphs
- Statistics on bargraphs of Catalan words
- Semi-perimeter and inner site-perimeter of k-ary words and bargraphs
- Counting water cells in bargraphs of compositions and set partitions
- Protected cells in bargraphs
- Combinatorial parameters in bargraphs
- Bargraph statistics on words and set partitions
- Bargraphs in bargraphs
- Counting border edges in bargraphs
- Maxima and visibility in involutions
- Parameters in inversion sequences
- Bargraphs of combinations with repetition
- Smooth squared, triangular and hexagonal bargraphs
- Restricted bargraphs and unimodal compositions
- Exterior corners on bargraphs of Motzkin words
- Letters of a given size in Catalan words
- Generating Trees and Fibonacci Polyominoes
- Grid graphs of Catalan words
- Enumeration of Catalan and smooth words according to capacity
- Lattice points on polyominoes of inversion sequences
- Counting rectangles of size r s in nondecreasing and Smirnov words
- Counting r s rectangles in (Catalan) words
- The combinatorics of Motzkin polyominoes
- Counting strong 2-cluster bargraphs
- Levels in baryiamonds
- Enumeration on polyominoes determined by Catalan words avoiding (≥,≥)
This page was built for publication: Enumerations on bargraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5210579)
