61,697 research outputs found
On the expected number of perfect matchings in cubic planar graphs
A well-known conjecture by Lov\'asz and Plummer from the 1970s asserted that
a bridgeless cubic graph has exponentially many perfect matchings. It was
solved in the affirmative by Esperet et al. (Adv. Math. 2011). On the other
hand, Chudnovsky and Seymour (Combinatorica 2012) proved the conjecture in the
special case of cubic planar graphs. In our work we consider random bridgeless
cubic planar graphs with the uniform distribution on graphs with vertices.
Under this model we show that the expected number of perfect matchings in
labeled bridgeless cubic planar graphs is asymptotically , where
and is an explicit algebraic number. We also
compute the expected number of perfect matchings in (non necessarily
bridgeless) cubic planar graphs and provide lower bounds for unlabeled graphs.
Our starting point is a correspondence between counting perfect matchings in
rooted cubic planar maps and the partition function of the Ising model in
rooted triangulations.Comment: 19 pages, 4 figure
Note on Ward-Horadam H(x) - binomials' recurrences and related interpretations, II
We deliver here second new recurrence formula,
were array is appointed by sequence of
functions which in predominantly considered cases where chosen to be
polynomials . Secondly, we supply a review of selected related combinatorial
interpretations of generalized binomial coefficients. We then propose also a
kind of transfer of interpretation of coefficients onto
coefficients interpretations thus bringing us back to
and Donald Ervin Knuth relevant investigation decades
ago.Comment: 57 pages, 8 figure
A Product Formula for the Normalized Volume of Free Sums of Lattice Polytopes
The free sum is a basic geometric operation among convex polytopes. This note
focuses on the relationship between the normalized volume of the free sum and
that of the summands. In particular, we show that the normalized volume of the
free sum of full dimensional polytopes is precisely the product of the
normalized volumes of the summands.Comment: Published in the proceedings of 2017 Southern Regional Algebra
Conferenc
Crystal constructions in Number Theory
Weyl group multiple Dirichlet series and metaplectic Whittaker functions can
be described in terms of crystal graphs. We present crystals as parameterized
by Littelmann patterns and we give a survey of purely combinatorial
constructions of prime power coefficients of Weyl group multiple Dirichlet
series and metaplectic Whittaker functions using the language of crystal
graphs. We explore how the branching structure of crystals manifests in these
constructions, and how it allows access to some intricate objects in number
theory and related open questions using tools of algebraic combinatorics
- …