Results 31 to 40 of about 33,775 (162)
A class of combinatorial identities
Discrete Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
The combinatorial structure of trigonometry
International Journal of Mathematics and Mathematical Sciences, 2003 The native mathematical language of trigonometry is combinatorial. Two interrelated combinatorial symmetric functions underlie trigonometry. We use their characteristics to derive identities for the trigonometric functions of multiple distinct angles ...
Adel F. Antippa
doaj +1 more source
Some Types of Identities Involving the Legendre Polynomials
Mathematics, 2019 In this paper, a new non-linear recursive sequence is firstly introduced. Then, using this sequence, a computational problem involving the convolution of the Legendre polynomial is studied using the basic and combinatorial methods.
Shimeng Shen, Li Chen
doaj +1 more source
Enumeration of Cylindric Plane Partitions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 Cylindric plane partitions may be thought of as a natural generalization of reverse plane partitions. A generating series for the enumeration of cylindric plane partitions was recently given by Borodin.
Robin Langer
doaj +1 more source
A Proof of the Extended Delta Conjecture
Forum of Mathematics, Pi, 2023 We prove the extended delta conjecture of Haglund, Remmel and Wilson, a combinatorial formula for $\Delta _{h_l}\Delta ' _{e_k} e_{n}$ , where $\Delta ' _{e_k}$ and $\Delta _{h_l}$ are Macdonald eigenoperators and $e_n$ is an ...
Jonah Blasiak +4 more
doaj +1 more source
Pfaffian Identities: A Combinatorial Approach
Journal of Combinatorial Theory, Series A, 2001 The Pfaffian of a skew symmetric matrix of even order is the square root of its determinant. \textit{D. E. Knuth} [Electron. J. Comb. 3, No. 2, Research paper R5, 13 p. (1996); printed version J. Comb. 3, No. 2, 147-159 (1996; Zbl 0862.15007)] suggested a combinatorial approach to Pfaffians based on arguments of graph theory and obtained an elegant ...
openaire +3 more sources
Spanning forests, electrical networks, and a determinant identity [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 We aim to generalize a theorem on the number of rooted spanning forests of a highly symmetric graph to the case of asymmetric graphs. We show that this can be achieved by means of an identity between the minor determinants of a Laplace matrix, for which ...
Elmar Teufl, Stephan Wagner
doaj +1 more source
Shortest path poset of finite Coxeter groups [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 We define a poset using the shortest paths in the Bruhat graph of a finite Coxeter group $W$ from the identity to the longest word in $W, w_0$. We show that this poset is the union of Boolean posets of rank absolute length of $w_0$; that is, any shortest
Saúl A. Blanco
doaj +1 more source
Factorization numbers of finite abelian groups [PDF]
International Journal of Group Theory, 2013 The number of factorizations of a finite abelian group as the product of two subgroups is computed in two different ways and a combinatorial identity involving Gaussian binomial coefficients is presented.
Mohammad Farrokhi Derakhshandeh Ghouchan
doaj
On the (r, p, k)-Generalized Jacobsthal Numbers and the Jacobsthal Fundamental Fibonacci System
Trends in Computational and Applied MathematicsThe main goal of this paper is to study the model of the sequences of (r, p, k)-generalized Jacobsthal numbers, by the approach based on the properties of its associated Jacobsthal fundamental Fibonacci system and its fundamental sequence.
M. Rachidi, F. Yilmaz
doaj +1 more source