The probability that a random monic -adic polynomial splits.
Buhler, Joe, Goldstein, Daniel, Moews, David, Rosenberg, Joel (2006)
Experimental Mathematics
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Planar binary trees and perturbative calculus of observables in classical field theory”
The probability that a random monic -adic polynomial splits.
Almost all trees have an even number of independent sets.
Wagner, Stephan G. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Right-cancellability of a family of operations on binary trees.
Duchon, Philippe (1998)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
On a matching distance between rooted phylogenetic trees
Damian Bogdanowicz, Krzysztof Giaro (2013)
International Journal of Applied Mathematics and Computer Science
Similarity:
The Robinson-Foulds (RF) distance is the most popular method of evaluating the dissimilarity between phylogenetic trees. In this paper, we define and explore in detail properties of the Matching Cluster (MC) distance, which can be regarded as a refinement of the RF metric for rooted trees. Similarly to RF, MC operates on clusters of compared trees, but the distance evaluation is more complex. Using the graph theoretic approach based on a minimum-weight perfect matching in bipartite graphs,...
Bijective proofs of identities from colored binary trees.
Yan, Sherry H.F. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The height of -binary search trees.
Drmota, Michael, Prodinger, Helmut (2002)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Probabilistic proofs of hook length formulas involving trees.
Sagan, Bruce E. (2009)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
On the Horton-Strahler number for combinatorial tries
Markus E. Nebel (2000)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On Catalan trees and the Jacobian conjecture.
Singer, Dan (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
NP-completeness of minimal width unordered tree layout.
Marriott, Kim, Stuckey, Peter J. (2004)
Journal of Graph Algorithms and Applications
Similarity:
A combinatorial proof of Postnikov's identity and a generalized enumeration of labeled trees.
Seo, Seunghyun (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity: