Spectra of Some Interesting Combinatorial Matrices Related to Oriented Spanning Trees on a Directed Graph

The Laplacian of a directed graph G is the matrix L(G) = O(G) –, A(G) where A(G) is the adjaceney matrix of G and O(G) the diagonal matrix of vertex outdegrees. The eigenvalues of G are the eigenvalues of A(G). Given a directed graph G we construct a derived directed graph D(G) whose vertices are the oriented spanning trees of G. Using a counting argument, we describe the eigenvalues of D(G) and their multiplicities in terms of the eigenvalues of the induced subgraphs and the Laplacian matrix of G. Finally we compute the eigenvalues of D(G) for some specific directed graphs G. A recent conjecture of Propp for D(H _n ) follows, where H _n stands for the complete directed graph on n vertices without loops.     

Phase diagram of the Ising Model on a Cayley tree in the presence of competing interactions and magnetic field

We study the phase diagram for the Ising Model on a Cayley tree with competing nearest-neighbor interactionsJ ₁ and next-nearest-neighbor interactionsJ ₂ andJ ₃ in the presence of an external magnetic field. To perform this study, an iterative scheme similar to that appearing in real space renormalization group frameworks is established; it recovers, as particular cases, previous works by Vannimenus and by Inawashiroet al. At vanishing temperature, the phase diagram is fully determined, for all values and signs ofJ ₂/J ₁ andJ ₃/J ₂; in particular, we verify that values ofJ ₃/J ₂ high enough favor the paramagnetic phase. At finite temperatures, several interesting features (evolution of reentrances, separation of the modulated region into two disconnected pieces, etc.) are exhibited for typical values ofJ ₂/J ₁ andJ ₃/J ₂.Partially supported by the Brazilian Agencies CNPq and FINEP.     

Classifying G-protein coupled receptors with bagging classification tree

G-protein coupled receptors (GPCRs) play a key role in different biological processes, such as regulation of growth, death and metabolism of cells. They are major therapeutic targets of numerous prescribed drugs. However, the ligand specificity of many receptors is unknown and there is little structural information available. Bioinformatics may offer one approach to bridge the gap between sequence data and functional knowledge of a receptor. In this paper, we use a bagging classification tree algorithm to predict the type of the receptor based on its amino acid composition. The prediction is performed for GPCR at the sub-family and sub-sub-family level. In a cross-validation test, we achieved an overall predictive accuracy of 91.1% for GPCR sub-family classification, and 82.4% for sub-sub-family classification. These results demonstrate the applicability of this relative simple method and its potential for improving prediction accuracy.     

On Gibbs measures of P-adic Potts model on the cayley tree

We consider a nearest-neighbor p-adic Potts (with q ≥ 2 spin values and coupling constant J ? _p) model on the Cayley tree of order k ≥ 1. It is proved that a phase transition occurs at k = 2, q ? p and p ≥ 3 (resp. q ? 2², p = 2). It is established that for p-adic Potts model at k ≥ 3 a phase transition may occur only at q ? p if p ≥ 3 and q ? 2² if p = 2.     

Trees, parking functions, syzygies, and deformations of monomial ideals

For a graph , we construct two algebras whose dimensions are both equal to the number of spanning trees of . One of these algebras is the quotient of the polynomial ring modulo certain monomial ideal, while the other is the quotient of the polynomial ring modulo certain powers of linear forms. We describe the set of monomials that forms a linear basis in each of these two algebras. The basis elements correspond to -parking functions that naturally came up in the abelian sandpile model. These ideals are instances of the general class of monotone monomial ideals and their deformations. We show that the Hilbert series of a monotone monomial ideal is always bounded by the Hilbert series of its deformation. Then we define an even more general class of monomial ideals associated with posets and construct free resolutions for these ideals. In some cases these resolutions coincide with Scarf resolutions. We prove several formulas for Hilbert series of monotone monomial ideals and investigate when they are equal to Hilbert series of deformations. In the appendix we discuss the abelian sandpile model.

     

A Complete Solution to a Conjecture on the β-Polynomials of Graphs

In 1990, Gutman and Mizoguchi conjectured that all roots of the -polynomial (G,C,x) of a graph G are real. Since then, there has been some literature intending to solve this conjecture. However, in all existing literature, only classes of graphs were found to show that the conjecture is true; for example, monocyclic graphs, bicyclic graphs, graphs such that no two circuits share a common edge, graphs without 3-matchings, etc, supporting the conjecture in some sense. Yet, no complete solution has been given. In this paper, we show that the conjecture is true for all graphs, and therefore completely solve this conjecture.     

The Topology of Algebra: Combinatorics of Squaring

We study the graph each of whose edges connects an element of a given ring with the square of itself. For a finite commutative group (e.g., for the multiplicative group of coprime residue classes modulo a positive integer), we describe this graph explicitly: each of its connected components is an oriented attracting cycle equipped with identical -vertex rooted trees of special form whose roots reside on the cycle. We also compute the graphs of permutation groups on not too many elements and of the subgroups of even permutations; the connected components of these graphs are also uniformly equipped cycles.     

Tangential Limits of Potentials on Homogeneous Trees

Let T be a homogeneous tree of homogeneity q+1. Let denote the boundary of T, consisting of all infinite geodesics b=[b ₀,b ₁,b ₂,] beginning at the root, 0. For each b, 1, and a0 we define the approach region _,a (b) to be the set of all vertices t such that, for some j, t is a descendant of b _j and the geodesic distance of t to b _j is at most (–1)j+a. If >1, we view these as tangential approach regions to b with degree of tangency . We consider potentials Gf on T for which the Riesz mass f satisfies the growth condition _T f ^p (t)q ^–|t|<, where p>1 and 0<<1, or p=1 and 0<1. For 11/, we show that Gf(s) has limit zero as s approaches a boundary point b within _,a (b) except for a subset E of of -dimensional Hausdorff measure 0, where H (E)=sup_>0inf _i q ^{–|t i|}:E a subset of the boundary points passing through t _i for some i,|t _i |>log _q (1/).     

On the nonexistence of finite time bubble trees in symmetric harmonic map heat flows from the disk to the 2-sphere

Let and be the unit disk and the unit sphere, and let be a radially symmetric harmonic map heat flow, whose singularities coincide with downward energy jumps. Then its finite time singularities are simple in the sense that precisely one harmonic sphere separates at a time.     

<Emphasis Type="Italic">X</Emphasis>-Trees and Weighted Quartet Systems

In this note, we consider a finite set X and maps W from the set $ \mathcal{S}_{2|2} (X) $ of all 2, 2- splits of X into $ \mathbb{R}_{\geq 0} $. We show that such a map W is induced, in a canonical way, by a binary X-tree for which a positive length $ \mathcal{l} (e) $ is associated to every inner edge e if and only if (i) exactly two of the three numbers W(ab|cd),W(ac|bd), and W(ad|cb) vanish, for any four distinct elements a, b, c, d in X, (ii) $ a \neq d \quad\mathrm{and}\quad W (ab|xc) + W(ax|cd) = W(ab|cd) $ holds for all a, b, c, d, x in X with #{a, b, c, x} = #{b, c, d, x} = 4 and $ W(ab|cx),W(ax|cd) $ > 0, and (iii) $ W (ab|uv) \geq \quad \mathrm{min} (W(ab|uw), W(ab|vw)) $ holds for any five distinct elements a, b, u, v, w in X. Possible generalizations regarding arbitrary $ \mathbb{R} $-trees and applications regarding tree-reconstruction algorithms are indicated.AMS Subject Classification: 05C05, 92D15, 92B05.