Results 101 to 110 of about 8,688 (230)
Some new families of compositions based on big part restrictions [PDF]
Discrete Mathematics Letters, 2022 Augustine O. Munagi, Mark Shattuck
doaj +1 more source
Discrete Mathematics, 2013 AbstractWe provide a bijective proof of the identity ∑x∈λ(h(x)2−c(x)2)=|λ|2 where λ is an integer partition, h(x) is the hook number of the cell x∈λ, and c(x) is the content of x. A closely related identity is also proved bijectively.
openaire +2 more sources
On the additive image of zeroth persistent homology
Transactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.Abstract For a category X$X$ and a finite field F$F$, we study the additive image of the functor H0(−;F)∗:rep(X,Top)→rep(X,VectF)$\operatorname{H}_0(-;F)_* \colon \operatorname{rep}(X, \mathbf {Top}) \rightarrow \operatorname{rep}(X, \mathbf {Vect}_F)$, or equivalently, of the free functor rep(X,Set)→rep(X,VectF)$\operatorname{rep}(X, \mathbf {Set ...
Ulrich Bauer +3 more
wiley +1 more source
A simple bijection between permutation tableaux and permutations
, 2006 We present a simple a bijection between permutations of $\{1,\ldots ,n\}$ with $k$ descents and permutation tableaux of length $n$ with $k ...
Corteel, Sylvie
core +1 more source
Bijections for partition identities
Journal of Combinatorial Theory, Series A, 1988 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Rational points on even‐dimensional Fermat cubics
Transactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.Abstract We show that even‐dimensional Fermat cubic hypersurfaces are rational over any field of characteristic not equal to three, by constructing explicit rational parameterizations with polynomials of low degree. As a byproduct of our rationality constructions, we obtain estimates for the number of their rational points over a number field and ...
Alex Massarenti
wiley +1 more source
Combinatorial Generation Algorithms for Directed Lattice Paths
MathematicsGraphs are a powerful tool for solving various mathematical problems. One such task is the representation of discrete structures. Combinatorial generation methods make it possible to obtain algorithms that can create discrete structures with specified ...
Yuriy Shablya +2 more
doaj +1 more source
Bijections behind the Ramanujan Polynomials
Advances 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 +3 more sources
On the automorphisms of the power semigroups of a numerical semigroup
Transactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.Abstract If H$H$ is a numerical semigroup (i.e., a cofinite subset of the non‐negative integers closed under addition), then the collection of all non‐empty subsets of H$H$ forms a semigroup P(H)$\mathcal {P}(H)$ under the sumset operation induced by addition in H$H$.
Salvatore Tringali, Kerou Wen
wiley +1 more source
A bijection for the evolution of $B$-trees
CoRR17 pages, 2 figures, accepted by 35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024)
Burghart, Fabian, Wagner, Stephan
openaire +6 more sources