Uniform random colored complexes

We present here random distributions on (D + 1)‐edge‐colored, bipartite graphs with a fixed number of vertices 2p. These graphs encode D‐dimensional orientable colored complexes. We investigate the behavior of those graphs as p→∞. The techniques involved in this study also yield a Central Limit Theorem for the genus of a uniform map of order p, as p→∞.     

A new arithmetic criterion for graphs being determined by their generalized Q-spectrum

“Which graphs are determined by their spectrum (DS for short)?” is a fundamental question in spectral graph theory. It is generally very hard to show a given graph to be DS and few results about DS graphs are known in literature. In this paper, we consider the above problem in the context of the generalized $Q$-spectrum. A graph $G$ is said to be determined by the generalized $Q$-spectrum (DGQS for short) if, for any graph $H$, $H$ and $G$ have the same $Q$-spectrum and so do their complements imply that $H$ is isomorphic to $G$. We give a simple arithmetic condition for a graph being DGQS. More precisely, let $G$ be a graph with adjacency matrix $A$ and degree diagonal matrix $D$. Let $Q=A+D$ be the signless Laplacian matrix of $G$, and $W_Q\left(G\right)=[e,Qe,\dots ,Q^{n-1}e]$ ($e$ is the all-ones vector) be the $Q$-walk matrix. We show that if $\frac{det{W}_Q\left(G\right)}{2^{\lfloor \frac{3n-2}{2}\rfloor }}$ (which is always an integer) is odd and square-free, then $G$ is DGQS.     

Meyniel's conjecture holds for random d‐regular graphs

In the game of cops and robber, the cops try to capture a robber moving on the vertices of the graph. The minimum number of cops required to win on a given graph G is called the cop number of G. The biggest open conjecture in this area is the one of Meyniel, which asserts that for some absolute constant C, the cop number of every connected graph G is at most . In a separate paper, we showed that Meyniel's conjecture holds asymptotically almost surely for the binomial random graph. The result was obtained by showing that the conjecture holds for a general class of graphs with some specific expansion‐type properties. In this paper, this deterministic result is used to show that the conjecture holds asymptotically almost surely for random d‐regular graphs when d = d(n) ≥ 3.     

Crystal planes and reciprocal space in Clifford geometric algebra

This paper discusses the geometry of kD crystal cells given by (k+ 1) points in a projective space ?^{n+ 1}. We show how the concepts of barycentric and fractional (crystallographic) coordinates, reciprocal vectors and dual representation are related (and geometrically interpreted) in the projective geometric algebra Cl(?^{n+ 1}) (see (Die Ausdehnungslehre von 1844 und die Geom. Anal. Teubner: Leipzig, 1894)) and in the conformal algebra Cl(?^{n+ 1, 1}). The crystallographic notions of d‐spacing, phase angle, structure factors, conditions for Bragg reflections, and the interfacial angles of crystal planes are obtained in the same context. Copyright © 2011 John Wiley & Sons, Ltd.     

由从属关系定义的亚纯多叶函数的子类的某些性质

In the present paper, we introduce some new subclasses of meromorphic starlike,convex, close-to-convex and quasi-convex functions of β-reciprocal in terms of the linear operator using subordination. We obtain the coefficient estimates, convolution properties, integral preserving properties and inclusion relationships of the classes. The results presented here include several results as their special cases.