Generalized level crossings and tangencies of a random field with smooth sample functions

Tangencies and level crossings of a random field X:$\text{R}$^m₊×Ω→$\text{R}$ⁿ (which is not necessarily Gaussian) are studied under the assumption that almost every sample path is continuously differentiable. If n=m and if the random field has uniformly bounded sample derivatives and uniformly bounded densities for the distributions of the X_l, then for a compact K?$\text{R}$^m₊ and any fixed level, the restriction to K of almost every sample path has no tangencies to the level and at most finitely many crossings. The case of n≠m is also examined. Some generic properties, which hold for a residual set of random fields, are analyzed. Proofs involve the concepts of regularity and transversality from differential topology.     

Isomorphisms of Certain Locally Nilpotent Finitary Groups and Associated Rings

For any chain Γ the ring NT(Γ,K) of all finitary Γ-matrices ‖a _ij ‖ _i,jεΓ over an associative ring K with zeros on and above the main diagonal is locally nilpotent and hence radical. If R′=NT(Γ′,K′),R=NT(Γ,K) and either |Γ|<∞ or K is a ring with no zero-divisors, then isomorphisms between rings R and R′, their adjoint groups and associated Lie rings are described.     

Remarkable valuation of the dichromatic polynomial of planar multigraphs

Let Γ be a finite multigraph; we denote by χ(Γ, x, y) the dichromatic polynominal of Γ, as defined by W. T. Tutte in 1953. We prove that, for any planar multigraph Γ with m edges, χ(Γ, ?1, ?1) = (?1)^m · (?2)^k, where $\text{0 ≤ k ≤}\text{m}\text{2}$. Furthermore, if Γ is connected, s = k ? 1 turns out to be a pertinent invariant of the medial of Γ.     

Riesz Means on Graphs and Discrete Groups

Suppose that Γ is a weighted graph or a discrete group. Let $m_{\alpha,R}(\lambda )=\big(1-\big|\frac{\lambda}{R}\big|\big)_{+}^{\alpha}$ be the Riesz means and let Δ be the discrete Laplacian on Γ. We prove that if D is the homogeneous dimension of Γ then the operator m _α,R (Δ) is bounded on L ^p , provided that $\alpha>D|\frac{1}{p}-\frac{1}{2}|$ .     

A constructive description of Hölder classes on closed Jordan curves

Let Γ be a closed, Jordan, rectifiable curve, whose are length is commensurable with its subtending chord, leta ε int Γ, and let R_n(a) be the set of rational functions of degree ≤n, having a pole perhaps only at the pointa. Let Λ^α(Γ), 0 < α < 1, be the Hölder class on Γ. One constructs a system of weights γ_n(z) > 0 on Γ such that f∈Λ^α(Γ) if and only if for any nonnegative integer n there exists a function R_n, R_n ε R_n(a) such that ¦f(z) ? R_n(z)¦ ≤ c_f·γ_n(z), z ε Γ. It is proved that the weights γ_n cannot be expressed simply in terms of ρ ₁ ⁺ /n^(z) and ρ ₁ ^- /n^(z), the distances to the level lines of the moduli of the conformal mappings of ext Γ and int Γ on \(\mathbb{C}\backslash \mathbb{D}\) .     

TWISTED CONJUGACY CLASSES IN LATTICES IN SEMISIMPLE LIE GROUPS

Given a group automorphism ?: Γ?→?Γ, one has an action of Γ on itself by ?-twisted conjugacy, namely, g.x?=?gx?(g ^?1). The orbits of this action are called ?-conjugacy classes. One says that Γ has the R∞-property if there are infinitely many ?-conjugacy classes for every automorphism ? of Γ. In this paper we show that any irreducible lattice in a connected semisimple Lie group having finite centre and rank at least 2 has the R∞-property.     

Group action for enumerating maps on surfaces

A map is a connected topological graph Γ cellularly embedded in a surface. For any connected graph Γ, by introducing the conception of semi-arc automorphism groupAut1/2 Γ and classifying all embedding of Γ under the action of this group, the numbersr ^o (Γ) andr ^N (Γ) of rooted maps on orientable and non-orientable surfaces with underlying graph Γ are found. Many closed formulas without sum Σ for the number of rooted maps on surfaces (orientable or non-orientable) with given underlying graphs, such as, complete graphK _n , complete bipartite graphK _m,n, bouquetsB _n , dipoleDp _n and generalized dipoleDp _n ^k,l are refound in this paper.     

A logarithmic-quadratic proximal point scalarization method for multiobjective programming

We present a proximal point method to solve multiobjective programming problems based on the scalarization for maps. We build a family of convex scalar strict representations of a convex map F from R ⁿ   to  R ^m with respect to the lexicographic order on R ^m and we add a variant of the logarithmic-quadratic regularization of Auslender, where the unconstrained variables in the domain of F are introduced in the quadratic term. The nonegative variables employed in the scalarization are placed in the logarithmic term. We show that the central trajectory of the scalarized problem is bounded and converges to a weak pareto solution of the multiobjective optimization problem.     

Random versions of Kakutani-Ky Fan's fixed point theorems

The following results are proved: (1) X be either a locally convex Lusin space¹ or a locally convex metrizable (not necessarily separable) space, let Γ be a weakly upper semicontinuous random multimapping defined on a convex compact subspace of X taking convex weakly compact values and satisfying the Browder-Halpern's “inward” condition. Then Γ has a fixed point. (2) In an arbitrary metric space, a continuous random multimapping Γ (with stochastic complete domain) has fixed points, whenever the corresponding deterministic fixed point theorem for Γ holds.     

Contact points of convex bodies

LetB be a convex body in ? ⁿ and let ? be an ellipsoid of minimal volume containingB. By contact points ofB we mean the points of the intersection between the boundaries ofB and ?. By a result of P. Gruber, a generic convex body in ? ⁿ has (n+3)·n/2 contact points. We prove that for every ?>0 and for every convex bodyB ? ? ⁿ there exists a convex bodyK having $$m \leqslant C(\varepsilon ) \cdot n\log ^3 n$$ contact points whose Banach-Mazur distance toB is less than 1+?. We prove also that for everyt>1 there exists a convex symmetric body Γ ? ? ⁿ so that every convex bodyD ? ? ⁿ whose Banach-Mazur distance to Γ is less thant has at least (1+c ₀/t ²)·n contact points for some absolute constantc ₀. We apply these results to obtain new factorizations of Dvoretzky-Rogers type and to estimate the size of almost orthogonal submatrices of an orthogonal matrix.     

Limits of translates of divergent geodesics and integral points on one-sheeted hyperboloids

For any non-uniform lattice Γ in SL₂(?), we describe the limit distribution of orthogonal translates of a divergent geodesic in Γ\SL₂(?). As an application, for a quadratic form Q of signature (2, 1), a lattice Γ in its isometry group, and v ₀ ∈ ?³ with Q(v ₀) > 0, we compute the asymptotic (with a logarithmic error term) of the number of points in a discrete orbit v ₀Γ of norm at most T, when the stabilizer of v ₀ in Γ is finite. Our result in particular implies that for any non-zero integer d, the smoothed count for the number of integral binary quadratic forms with discriminant d ² and with coefficients bounded by T is asymptotic to c · T log T + O(T).     

Cotorsion pairs associated with Auslander categories

Let N ≥ n + 1, and denote by K the convex hull of N independent standard gaussian random vectors in ℝⁿ. We prove that with high probability, the isotropic constant of K is bounded by a universal constant. Thus we verify the hyperplane conjecture for the class of gaussian random polytopes. Supported by the Clay Mathematics Institute and by NSF grant #DMS-0456590     

Iterated Boolean random varieties and application to fracture statistics models

Models of random sets and of point processes are introduced to simulate some specific clustering of points, namely on random lines in R² and R³ and on random planes in R³. The corresponding point processes are special cases of Cox processes. The generating distribution function of the probability distribution of the number of points in a convex set K and the Choquet capacity T (K) are given. A possible application is to model point defects in materials with some degree of alignment. Theoretical results on the probability of fracture of convex specimens in the framework of the weakest link assumption are derived, and used to compare geometrical effects on the sensitivity of materials to fracture.     

The number of Hamiltonian decompositions of regular graphs

A Hamilton cycle in a graph Γ is a cycle passing through every vertex of Γ. A Hamiltonian decomposition of Γ is a partition of its edge set into disjoint Hamilton cycles. One of the oldest results in graph theory is Walecki’s theorem from the 19th century, showing that a complete graph K _n on an odd number of vertices n has a Hamiltonian decomposition. This result was recently greatly extended by Kühn and Osthus. They proved that every r-regular n-vertex graph Γ with even degree r = cn for some fixed c > 1/2 has a Hamiltonian decomposition, provided n = n(c) is sufficiently large. In this paper we address the natural question of estimating H(Γ), the number of such decompositions of Γ. Our main result is that H(Γ) = r ^(1+o(1))nr/2. In particular, the number of Hamiltonian decompositions of K _n is \({n^{\left( {1 + o\left( 1 \right)} \right){n^2}/2}}\).     

Upper Bounds for the Automorphic Chromatic Index of a Graph

The automorphic H-chromatic index of a graph Γ is the minimum integer m for which Γ has a proper edge-coloring with m colors preserved by a given subgroup H of the full automorphism group of Γ. We determine upper bounds for this index in terms of the chromatic index of Γ for some abelian 2-groups H.     

The girth of a thin distance-regular graph

Let Γ be a distance-regular graph of diameterd≥3. For each vertexx of Γ, letT(x) denote the Terwilliger algebra for Γ with respect tox. An irreducibleT(x)-moduleW is said to bethin if dimE _i ^* (x)W≤1 for 0≤i≤d, whereE _i ^* (x) is theith dual idempotent for Γ with respect tox. The graph Γ isthin if for each vertexx of Γ, every irreducibleT(x)-module is thin. Aregular generalized quadrangle is a bipartite distance-regular graph with girth 8 and diameter 4. Our main results are as follows: Theorem. Let Γ=(X,R) be a distance-regular graph with diameter d≥3 and valency k≥3. Then the following are equivalent:

1. Γis a regular generalized quadrangle.
2. Γis thin and c ₃=1.

Corollary. Let Γ=(X,R) be a thin distance-regular graph with diameter d≥3 and valency k≥3. Then Γ has girth 3, 4, 6, or 8. Then girth of Γ is 8 exactly when Γ is a regular generalized quadrangle.     

Martin boundaries of random walks on Fuchsian groups

Let Γ be a finitely generated non-elementary Fuchsian group, and let μ be a probability measure with finite support on Γ such that supp μ generates Γ as a semigroup. If Γ contains no parabolic elements we show that for all but a small number of co-compact Γ, the Martin boundaryM of the random walk on Γ with distribution μ can be identified with the limit set Λ of Γ. If Γ has cusps, we prove that Γ can be deformed into a group Γ', abstractly isomorphic to Γ, such thatM can be identified with Λ', the limit set of Γ'. Our method uses the identification of Λ with a certain set of infinite reduced words in the generators of Γ described in [15]. The harmonic measure ν (ν is the hitting distribution of random paths in Γ on Λ) is a Gibbs measure on this space of infinite words, and the Poisson boundary of Γ, μ can be identified with Λ, ν.     

Cohomology of discontinuous groups

Prasad (1979) proved that the set of all equivalence classes of representationsp of a Fuchsian group Γ whose restrictions to the cyclic subgroups Γ _i -(c _i ) corresponding to the parabolic and elliptic elements of Γ occurring in the structure of Γ, are given, is a complex analytic manifold. In the process the author has proved thatH ¹(X,A)≈P ¹(Γ,ρ) and with suitable notation. This paper gives the corresponding results to the two above mentioned results, when in place of Γ we consider any discontinuous group of Poincare isometries Δ, and when similar assumptions are made.     

Sure wins, separating probabilities and the representation of linear functionals

We discuss conditions under which a convex cone K⊂RΩ admits a finitely additive probability m such that supk∈Km(k)?0. Based on these, we characterise those linear functionals that are representable as finitely additive expectations. A version of Riesz decomposition based on this property is obtained as well as a characterisation of positive functionals on the space of integrable functions.     

Convergence of random zeros on complex manifolds

We show that the zeros of random sequences of Gaussian systems of polynomials of in- creasing degree almost surely converge to the expected limit distribution under very general hypotheses. In particular,the normalized distribution of zeros of systems of m polynomials of degree N,orthonor- malized on a regular compact set K(?)C~m,almost surely converge to the equilibrium measure on K as N→∞.