Results 11 to 20 of about 3,063 (228)

Bijections for Permutation Tableaux [PDF]

open access: greenDiscrete Mathematics & Theoretical Computer Science, 2008
In this paper we propose a new bijection between permutation tableaux and permutations. This bijection shows how natural statistics on the tableaux are equidistributed to classical statistics on permutations: descents, RL-minima and pattern enumerations.
Sylvie Corteel, Philippe Nadeau
doaj   +7 more sources

A Bijection for Directed-Convex Polyominoes [PDF]

open access: diamondDiscrete Mathematics & Theoretical Computer Science, 2001
In this paper we consider two classes of lattice paths on the plane which use \textitnorth, \textiteast, \textitsouth,and \textitwest unitary steps, beginningand ending at (0,0).We enumerate them according to the number ofsteps by means of bijective ...
Alberto Del Lungo   +3 more
doaj   +5 more sources

Continuous bijections on manifolds [PDF]

open access: bronzeJournal of the Australian Mathematical Society, 1976
AbstractThe main results of the paper give necessary and sufficient conditions as well as sufficient conditions that continuous bijections of a manifold onto itself be homeomorphisms. Such conditions include the embedding of manifolds, preserving ends, preserving closed half-rays and restrictions on boundary components.
J. G. Hocking, P. H. Doyle
openaire   +4 more sources

A short Rogers-Ramanujan bijection

open access: bronzeDiscrete Mathematics, 1982
Recently \textit{A. M. Garsia} and \textit{S. C. Milne} [Proc. Natl. Acad. Sci. USA 78, 2026--2028 (1981; Zbl 0464.05007)] proved the Rogers-Ramanujan identity by presenting a bijection between \(C(n)\) the number of partitions of \(n\) with parts \(\equiv 1, 4 \pmod 5\) and \(A(n)\) the number of partitions of \(n\) with minimal difference \(2\).
Doron Zeilberger, David M. Bressoud
openaire   +3 more sources

Bijections for refined restricted permutations [PDF]

open access: greenJournal of Combinatorial Theory, Series A, 2004
We present a bijection between 321- and 132-avoiding permutations that preserves the number of fixed points and the number of excedances. This gives a simple combinatorial proof of recent results of Robertson, Saracino and Zeilberger, and the first author.
Sergi Elizalde, Igor Pak
openaire   +4 more sources

Bijections behind the Ramanujan Polynomials

open access: greenAdvances in Applied Mathematics, 2001
The Ramanujan polynomials were introduced by Ramanujan in his study of power series inversions. In an approach to the Cayley formula on the number of trees, Shor discovers a refined recurrence relation in terms of the number of improper edges, without realizing the connection to the Ramanujan polynomials.
William Y. C. Chen, Victor J. W. Guo
openaire   +6 more sources

On bijections that preserve complementarity of subspaces [PDF]

open access: greenDiscrete Mathematics, 2005
The set $G$ of all $m$-dimensional subspaces of a $2m$-dimensional vector space $V$ is endowed with two relations, complementarity and adjacency. We consider bijections from $G$ onto $G'$, where $G'$ arises from a $2m'$-dimensional vector space $V'$. If such a bijection $ϕ$ and its inverse leave one of the relations from above invariant, then also the ...
Hans Havlicek, Andrea Blunck
openaire   +5 more sources

A bijection for nonorientable general maps [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2020
We give a different presentation of a recent bijection due to Chapuy and Dołe ̨ga for nonorientable bipartite quadrangulations and we extend it to the case of nonorientable general maps.
Jérémie Bettinelli
doaj   +6 more sources

Challenges in the Computational Modeling of the Protein Structure—Activity Relationship

open access: yesComputation, 2021
Living organisms are composed of biopolymers (proteins, nucleic acids, carbohydrates and lipid polymers) that are used to keep or transmit information relevant to the state of these organisms at any given time. In these processes, proteins play a central
Gabriel Del Río
doaj   +1 more source

Geometry and complexity of O'Hara's algorithm [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2009
In this paper we analyze O'Hara's partition bijection. We present three type of results. First, we see that O'Hara's bijection can be viewed geometrically as a certain scissor congruence type result.
Matjaž Konvalinka, Igor Pak
doaj   +1 more source

Home - About - Disclaimer - Privacy