Integral trees of odd diameters

A graph is called integral if all eigenvalues of its adjacency matrix consist entirely of integers. Recently, Csikvári proved the existence of integral trees of any even diameter. In the odd case, integral trees have been constructed with diameter at most 7. In this article, we show that for every odd integer n>1, there are infinitely many integral trees of diameter n. © 2011 Wiley Periodicals, Inc. J Graph Theory     

On-line arbitrarily vertex decomposable trees

A tree T is arbitrarily vertex decomposable if for any sequence τ of positive integers adding up to the order of T there is a sequence of vertex-disjoint subtrees of T whose orders are given by τ. An on-line version of the problem of characterizing arbitrarily vertex decomposable trees is completely solved here.     

On arbitrarily vertex decomposable trees

A tree T is arbitrarily vertex decomposable if for any sequence τ of positive integers adding up to the order of T there is a sequence of vertex-disjoint subtrees of T whose orders are given by τ; from a result by Barth and Fournier it follows that Δ(T)?4. A necessary and a sufficient condition for being an arbitrarily vertex decomposable star-like tree have been exhibited. The conditions seem to be very close to each other.     

Integral trees of diameter 6

A graph G is called integral if all eigenvalues of its adjacency matrix A(G) are integers. In this paper, the trees T(p,q)•T(r,m,t) and K_1,s•T(p,q)•T(r,m,t) of diameter 6 are defined. We determine their characteristic polynomials. We also obtain for the first time sufficient and conditions for them to be integral. To do so, we use number theory and apply a computer search. New families of integral trees of diameter 6 are presented. Some of these classes are infinite. They are different from those in the existing literature. We also prove that the problem of finding integral trees of diameter 6 is equivalent to the problem of solving some Diophantine equations. We give a positive answer to a question of Wang et al. [Families of integral trees with diameters 4, 6 and 8, Discrete Appl. Math. 136 (2004) 349-362].     

Attitude change in arbitrarily large organizations

The alignment of collective goals and individual behavior has been extensively studied by economists under a principal-agent framework. Two main solutions have been presented: explicit incentive contracts and monitoring. These solutions correspond to changes in the objective situation faced by individuals. However, an extensive literature in social psychology provides evidence that behavior is influenced, not only by situational constraints, but also by attitudes. Therefore, an important aspect of organization is to choose the structures and procedures that best contribute to the dissemination of the desired attitudes throughout the organization. This paper studies how the initial configuration of attitudes and the size of the organization affect the optimal organizational structure and the timing of information flows when the objective is to align the members’ attitudes. We identify and characterize three factors that affect the optimal organizational structures and procedures and the degree of alignment of attitudes: (1) clustering effects; (2) member cross-influence effects; and (3) leader cross-influence effects.     

Bass-Tits minimization of automata, quotients of trees and diameters

Let X be a tree and let G=Aut(X), Bass and Tits have given an algorithm to construct the ‘ultimate quotient’ of X by G starting with any quotient of X, an ‘edge-indexed’ graph. Using a sequence of integers that we compute at consecutive steps of the Bass-Tits (BT) algorithm, we give a lower bound on the diameter of the ultimate quotient of a tree by its automorphism group. For a tree X with finite quotient, this gives a lower bound on the minimum number of generators of a uniform X-lattice whose quotient graph coincides with G?X. This also gives a criterion to determine if the ultimate quotient of a tree is infinite. We construct an edge-indexed graph (A,i) for a deterministic finite state automaton and show that the BT algorithm for computing the ultimate quotient of (A,i) coincides with state minimizing algorithm for finite state automata. We obtain a lower bound on the minimum number of states of the minimized automaton. This gives a new proof that language for the word problem in a finitely generated group is regular if and only if the group is finite, and a new proof that the language of the membership problem for a subgroup is regular if and only if the subgroup has finite index.     

Graphs of given genus and arbitrarily large maximum genus

The maximum genus of a connected graph G is the maximum among the genera of all compact orientable 2-manifolds upon which G has 2-cell embeddings. In the theorems that follow the use of an edge-adding technique is combined with the well-known Edmonds' technique to produce the desired results. Planar graphs of arbitrarily large maximum genus are displayed in Theorem 1. Theorem 2 shows that the possibility for arbitrarily large difference between genus and maximum genus is not limited to planar graphs. In particular, we show that the wheel graph, the standard maximal planar graph, and the prism graph are upper embeddable. We then show that given m and n, there is a graph of genus n and maximum genus larger than mn.     

Nonorientable triangular embeddings of complete graphs with arbitrarily large looseness

The looseness of a triangular embedding of a complete graph in a closed surface is the minimum integer m such that for every assignment of m colors to the vertices of the embedding (such that all m colors are used) there is a face incident with vertices of three distinct colors. In this paper we show that for every p?3 there is a nonorientable triangular embedding of a complete graph with looseness at least p.     

Selmer groups of elliptic curves that can be arbitrarily large

In this article, it is shown that certain kinds of Selmer groups of elliptic curves can be arbitrarily large. The main result is that if p is a prime at least 5, then p-Selmer groups of elliptic curves can be arbitrarily large if one ranges over number fields of degree at most g+1 over the rationals, where g is the genus of X₀(p). As a corollary, one sees that p-Selmer groups of elliptic curves over the rationals can be arbitrarily large for p=5,7 and 13 (the cases p?7 were already known). It is also shown that the number of elements of order N in the N-Selmer group of an elliptic curve over the rationals can be arbitrarily large for N=9,10,12,16 and 25.     

Plane polar Cremona maps of arbitrarily large degree in positive characteristic

Geometriae Dedicata - A result of I.V. Dolgachev states that the complex homaloidal polynomials in three variables, i.e. the complex homogeneous polynomials whose polar map is birational, are of...     

Thermodynamic limit for large random trees

We consider Gibbs distributions on finite random plane trees with bounded branching. We show that as the order of the tree grows to infinity, the distribution of any finite neighborhood of the root of the tree converges to a limit. We compute the limiting distribution explicitly and study its properties. We introduce an infinite random tree consistent with these limiting distributions and show that it satisfies a certain form of the Markov property. We also study the growth of this tree and prove several limit theorems including a diffusion approximation. © 2010 Wiley Periodicals, Inc. Random Struct. Alg., 2010     

Explicit examples of arbitrarily large analytic ergodic potentials with zero Lyapunov exponent

We give explicit examples of arbitrarily large analytic ergodic potentials for which the Schr?dinger equation has zero Lyapunov exponent for certain energies. For one of these energies there is an explicit solution. In the quasi-periodic case we prove that one can have positive Lyapunov exponent on certain regions of the spectrum and zero on other regions. We also show the existence of 1-dependent random potentials with zero Lyapunov exponent. Research partially supported by the Swedish Foundation for International Cooperation in Research and Higher Education (STINT), Institutional Grant 2002-2052. Received: February 2005; Accepted: May 2005     

Induced trees in graphs of large chromatic number

Gyárfás and Sumner independently conjectured that for every tree T and integer k there is an integer f(k, T) such that every graph G with χ(G) > f(k, t) contains either K_k or an induced copy of T. We prove a ‘topological’ version of the conjecture: for every tree T and integer k there is g(k,T) such that every graph G with χ(G) > g(k,t) contains either K_k or an induced copy of a subdivision of T. © 1997 John Wiley & Sons, Inc.     

Incidence posets of trees in posets of large dimension

In this paper, we investigate substructures of partially ordered sets which must be present whenever the dimension is large. We show that for eachn1, ifT is a tree onn vertices and ifP is any poset having dimension at least 4n ⁶, then eitherP or its dual contains the incidence poset ofT as a suborder.     

Dominating and large induced trees in regular graphs

Recently Chen et al. [Tree domination in graphs, Ars Combin. 73 (2004) 193-203] asked for characterizations of the class of graphs and the class of regular graphs that have an induced dominating tree, i.e. for which there exists a dominating set that induces a tree.We give a somewhat negative answer to their question by proving that the corresponding decision problems are NP-complete. Furthermore, we prove essentially best-possible lower bounds on the maximum order of induced trees in connected cacti of maximum degree 3 and connected cubic graphs.Finally, we give a forbidden induced subgraph condition for the existence of induced dominating trees.     

Martingales and large deviations for binary search trees

We establish an almost sure large deviations theorem for the depth of the external nodes of binary search trees (BSTs). To achieve this, a parametric family of martingales is introduced. This family also allows us to get asymptotic results on the number of external nodes at deepest level. © 2001 John Wiley & Sons, Inc. Random Struct. Alg., 19: 112–127, 2001