Relevant bibliographies by topics / Sylvester's bijection

Contents

  1. Journal articles
  2. Dissertations / Theses

Academic literature on the topic 'Sylvester's bijection'

Author: Grafiati
Published: 4 June 2021
Last updated: 4 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Sylvester's bijection.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Sylvester's bijection"

1

Lascoux, Alain. "Sylvester's bijection between strict and odd partitions." Discrete Mathematics 277, no. 1-3 (February 2004): 275–78. http://dx.doi.org/10.1016/j.disc.2002.02.001.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Zeng, Jiang. "The q-Variations of Sylvester’s Bijection Between Odd and Strict Partitions." Ramanujan Journal 9, no. 3 (June 2005): 289–303. http://dx.doi.org/10.1007/s11139-005-1869-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Bessenrodt, Christine. "A bijection for Lebesgue's partition identity in the spirit of Sylvester." Discrete Mathematics 132, no. 1-3 (September 1994): 1–10. http://dx.doi.org/10.1016/0012-365x(94)90228-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Mohindru, Preeti, and Rajesh Pereira. "Tan’s Epsilon-Determinant and Ranks of Matrices over Semirings." International Scholarly Research Notices 2015 (February 4, 2015): 1–8. http://dx.doi.org/10.1155/2015/242515.

Full text
Abstract:
We use the ϵ-determinant introduced by Ya-Jia Tan to define a family of ranks of matrices over certain semirings. We show that these ranks generalize some known rank functions over semirings such as the determinantal rank. We also show that this family of ranks satisfies the rank-sum and Sylvester inequalities. We classify all bijective linear maps which preserve these ranks.
APA, Harvard, Vancouver, ISO, and other styles
5

Konvalinka, Matjaž. "An Inverse Matrix Formula in the Right-Quantum Algebra." Electronic Journal of Combinatorics 15, no. 1 (February 4, 2008). http://dx.doi.org/10.37236/747.

Full text
Abstract:
The right-quantum algebra was introduced recently by Garoufalidis, Lê and Zeilberger in their quantum generalization of the MacMahon master theorem. A bijective proof of this identity due to Konvalinka and Pak, and also the recent proof of the right-quantum Sylvester's determinant identity, make heavy use of a bijection related to the first fundamental transformation on words introduced by Foata. This paper makes explicit the connection between this transformation and right-quantum linear algebra identities; we give a new, bijective proof of the right-quantum matrix inverse theorem, we show that similar techniques prove the right-quantum Jacobi ratio theorem, and we use the matrix inverse formula to find a generalization of the (right-quantum) MacMahon master theorem.
APA, Harvard, Vancouver, ISO, and other styles
6

Chen, William Y. C., Ae Ja Yee, and Albert J. W. Zhu. "Euler's Partition Theorem with Upper Bounds on Multiplicities." Electronic Journal of Combinatorics 19, no. 3 (October 4, 2012). http://dx.doi.org/10.37236/2318.

Full text
Abstract:
We show that the number of partitions of $n$ with alternating sum $k$ such that the multiplicity of each part is bounded by $2m+1$ equals the number of partitions of $n$ with $k$ odd parts such that the multiplicity of each even part is bounded by $m$. The first proof relies on two formulas with two parameters that are related to the four-parameter formulas of Boulet. We also give a combinatorial proof of this result by using Sylvester's bijection, which implies a stronger partition theorem. For $m=0$, our result reduces to Bessenrodt's refinement of Euler's partition theorem. If the alternating sum and the number of odd parts are not taken into account, we are led to a generalization of Euler's partition theorem, which can be deduced from a theorem of Andrews on equivalent upper bound sequences of multiplicities. Analogously, we show that the number of partitions of $n$ with alternating sum $k$ such that the multiplicity of each even part is bounded by $2m+1$ equals the number of partitions of $n$ with $k$ odd parts such that the multiplicity of each even part is also bounded by $2m+1$. We provide a combinatorial proof as well.
APA, Harvard, Vancouver, ISO, and other styles
7

Bayat, M. "A bijective proof of generalized Cauchy–Binet, Laplace, Sylvester and Dodgson formulas." Linear and Multilinear Algebra, October 12, 2020, 1–11. http://dx.doi.org/10.1080/03081087.2020.1832952.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Pilaud, Vincent. "Brick polytopes, lattices and Hopf algebras." Discrete Mathematics & Theoretical Computer Science DMTCS Proceedings, 28th... (April 22, 2020). http://dx.doi.org/10.46298/dmtcs.6401.

Full text
Abstract:
International audience Generalizing the connection between the classes of the sylvester congruence and the binary trees, we show that the classes of the congruence of the weak order on Sn defined as the transitive closure of the rewriting rule UacV1b1 ···VkbkW ≡k UcaV1b1 ···VkbkW, for letters a < b1,...,bk < c and words U,V1,...,Vk,W on [n], are in bijection with acyclic k-triangulations of the (n + 2k)-gon, or equivalently with acyclic pipe dreams for the permutation (1,...,k,n + k,...,k + 1,n + k + 1,...,n + 2k). It enables us to transport the known lattice and Hopf algebra structures from the congruence classes of ≡k to these acyclic pipe dreams, and to describe the product and coproduct of this algebra in terms of pipe dreams. Moreover, it shows that the fan obtained by coarsening the Coxeter fan according to the classes of ≡k is the normal fan of the corresponding brick polytope
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Sylvester's bijection"

1

Silva, Eduardo Alves da. "Formas ponderadas do Teorema de Euler e partições com raiz : estabelecendo um tratamento combinatório para certas identidades de Ramanujan." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2018. http://hdl.handle.net/10183/183163.

Full text
Abstract:
O artigo Weighted forms of Euler's theorem de William Y.C. Chen e Kathy Q. Ji, em resposta ao questionamento de George E. Andrews, matemático estadunidense, sobre encontrar demonstrações combinatórias de duas identidades no Caderno Perdido de Ramanujan, nos mostra algumas formas ponderadas do Teorema de Euler sobre partições com partes ímpares e partes distintas via a introdução do conceito de partição com raiz. A propositura deste trabalho é envolta à apresentação de resultados sobre partições com raiz de modo a posteriormente realizar formulações combinatórias das identidades de Ramanujan por meio deste conceito, procurando estabelecer conexões com formas ponderadas do Teorema de Euler. Em particular, a bijeção de Sylvester e a iteração de Pak da função de Dyson são elementos primordiais para obtê-las.
The article Weighted forms of Euler's theorem by William Y.C. Chen and Kathy Q. Ji in response to the questioning of George E. Andrews, American mathematician, about nding combinatorial proofs for two identities in Ramanujan's Lost Notebook shows us some weighted forms of Euler's Theorem on partitions with odd parts and distinct parts through the introduction of the concept of rooted partition. The purpose of this work involves the presentation of results on rooted partitions in order to make combinatorial formulations of Ramanujan's identities, seeking to establish connections with weighted forms of Euler's Theorem. In particular, the Sylvester's bijection and the Pak's iteration of the Dyson's map are primordial elements to obtain them.
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography