ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Education
Literature
Languages
Social Sciences
Religion
History
Technology
Economy
Philosophy
Architecture and Urbanism
all records (73)

Languages
English
Spanish
Portuguese
French
German

Countries
Indonesia
USA
Spain
Brazil
Ukraine
Australia
South Africa
Chile
Canada
Poland
all records (80)

Years
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
all records (24)

Filter  
 
4.858  Articles
1 of 487 pages  |  10  records  |  more records»
In this paper we study the cycle descent statistic on permutations. Several involutions on permutations and derangements are constructed. Moreover, we construct a bijection between negative cycle descent permutations and Callan perfect matchings.

A graph G is perfect matching transitive, shortly PM-transitive, if for any two perfect matchings M1 and M2 of G, there is an automorphism f : V(G)?V(G) such that fe(M1)=M2, where fe(uv)=f(u)f(v). In ... see more

We find a Thron-type continued fraction (T-fraction) for the ordinary generating function of the Ward polynomials, as well as for some generalizations employing a large (indeed infinite) family of independent indeterminates. Our proof is based on a biject... see more

We study a discrete dynamic on weighted bipartite graphs on a torus, analogous to dimer integrable systems in Goncharov-Kenyon 2013. The dynamic on the graph is an urban renewal together with shrinking all 2-valent vertices, while it is a cluster transfor... see more

In this paper we study the cycle descent statistic on permutations. Several involutions on permutations and derangements are constructed. Moreover, we construct a bijection between negative cycle descent permutations and Callan perfect matchings.

It is well-known that plane partitions, lozenge tilings of a hexagon, perfect matchings on a honeycomb graph, and families of non-intersecting lattice paths in a hexagon are all in bijection. In this work we consider regions that are more general than hex... see more

We give an algorithmic computation for the height of Kauffman's clock lattice obtained from a knot diagram with two adjacent regions starred and without crossing information specified. We show that this lattice is more familiarly the graph of perfect... see more

In 2003, Ciucu presented a unified way to enumerate tilings of lattice regions by using a certain Reduction Theorem (J. Algebraic Combin., 2003). In this paper we continue this line of work by investigating new families of lattice regions whose tilings ar... see more

The perfect matching complex of a graph is the simplicial complex on the edge set of the graph with facets corresponding to perfect matchings of the graph. This paper studies the perfect matching complexes, Mp(Hk×m×n)\mathcal{M}_p(H_{k \times m\times n}),... see more

1 of 487 pages  |  10  records  |  more records»