Results 51 to 60 of about 2,203 (125)

On coefficients of circuit polynomials and characteristic polynomials

International Journal of Mathematics and Mathematical Sciences, Volume 8, Issue 4, Page 697-705, 1985., 1985
Results are given from which expressions for the coefficients of the simple circuit polynomial of a graph can be obtained in terms of subgraphs of the graph. From these are deduced parallel results for the coefficients of the characteristic polynomial of a graph.
E. J. Farrell
wiley   +1 more source

Variants of Schroeder Dissections [PDF]

, 1999
Some formulae are given for the enumeration of certain types of dissections of the convex (n+2)-gon by non-crossing diagonals. The classical Schroeder and Motzkin numbers are addressed using a cataloguing tool, the "reversive symbol".
Smiley, Leonard M.
core  

Path decompositions of chains and circuits

International Journal of Mathematics and Mathematical Sciences, Volume 6, Issue 3, Page 521-533, 1983., 1983
Expressions for the path polynomials (see Farrell [1]) of chains and circuits are derived. These polynomials are then used to deduce results about node disjoint path decompositions of chains and circuits. Some results are also given for decompositions in which specific paths must be used.
E. J. Farrell
wiley   +1 more source

Conditional Probabilities of Multivariate Poisson Distributions [PDF]

, 2012
Multivariate Poisson distributions have numerous applications. Fast computation of these distributions, holding constant a fixed set of linear combinations of these variables, has been explored by Sontag and Zeilberger.
Burkhart, Michael C.
core  

Transcendental holomorphic maps between real algebraic manifolds in a complex space

, 2019
We give an example of a real algebraic manifold embedded in a complex space that does not satisfy the Nash-Artin approximation Property. This Nash-Artin approximation Property is closely related to the problem of determining when the biholomorphic ...
Rond, Guillaume
core   +2 more sources

Equivalence classes of functions on finite sets

International Journal of Mathematics and Mathematical Sciences, Volume 5, Issue 4, Page 745-762, 1982., 1982
By using Pólya′s theorem of enumeration and de Bruijn′s generalization of Pólya′s theorem, we obtain the numbers of various weak equivalence classes of functions in RD relative to permutation groups G and H where RD is the set of all functions from a finite set D to a finite set R, G acts on D and H acts on R.
Chong-Yun Chao, Caroline I. Deisher
wiley   +1 more source

A generalization of the dichromatic polynomial of a graph

International Journal of Mathematics and Mathematical Sciences, Volume 4, Issue 4, Page 725-729, 1981., 1981
The Subgraph polynomial fo a graph pair (G, H), where H⫅G, is defined. By assigning particular weights to the variables, it is shown that this polynomial reduces to the dichromatic polynomial of G. This idea of a graph pair leads to a dual generalization of the dichromatic polynomial.
E. J. Farrell
wiley   +1 more source

On the number of vertices of each rank in phylogenetic trees and their generalizations [PDF]

Discrete Mathematics & Theoretical Computer Science, 2016
We find surprisingly simple formulas for the limiting probability that the rank of a randomly selected vertex in a randomly selected phylogenetic tree or generalized phylogenetic tree is a given integer.
Miklós Bóna
doaj   +1 more source

Fibonacci Cartan and Lucas Cartan numbers

Open Mathematics
This study introduces Fibonacci Cartan and Lucas Cartan numbers, extending the classical Fibonacci and Lucas sequences into the framework of Cartan numbers.
Öztürk İskender, Çakır Hasan
doaj   +1 more source

The permutation class Av(4213,2143) [PDF]

Discrete Mathematics & Theoretical Computer Science, 2017
We determine the structure of permutations avoiding the patterns 4213 and 2143. Each such permutation consists of the skew sum of a sequence of plane trees, together with an increasing sequence of points above and an increasing sequence of points to its ...
David Bevan
doaj   +1 more source