The odderon equation is studied in terms of the variable suggested by the modular invariance of the 3 Reggeon system. Odderon charge is identified with the cross-product of three conformal spins. A complete set of commuting operators: ĥ2 and q̂ is diagonalized and quantization conditions for eigenvalues of the odderon charge q̂ are solved for arbitrary conformal weigth h. PACS: 12.38.Cy; 11.55.Jy.

"This paper evaluates the influence of residential density on commuting behavior across U.S. cities while controlling for available opportunities, the technology of transportation infrastructure, and individual socio-economic and demographic characteristics. The measures of metropolitan and local density are addressed separately.... Regressions are conducted to predict commuting time, speed, an...

in this paper we study the existence of commuting regular elements, verifying the notion left (right) commuting regular elements and its properties in the groupoid g(n) . also we show that g(n) contains commuting regular subsemigroup and give a necessary and sucient condition for the groupoid g(n) to be commuting regular.

For a Markov operator on Teichm uller space commuting with the action of the mapping class group we prove convergence of sample paths of the associated Markov chain in the Thurston compactiication and show that the Poisson boundary of the Markov operator can be identiied with the space of projective measured foliations. The approach consists in using the authors' results on the Poisson boundary...

‎Let $G$ be a finite non-abelian group with center $Z(G)$‎. ‎The non-commuting graph of $G$ is a simple undirected graph whose vertex set is $Gsetminus Z(G)$ and two vertices $x$ and $y$ are adjacent if and only if $xy ne yx$‎. ‎In this paper‎, we compute Laplacian energy of the non-commuting graphs of some classes of finite non-abelian groups‎..

let g be a group. a subset x of g is a set of pairwise noncommuting elements if xy ̸= yx for any two distinct elements x and y in x. if |x| ≥ |y | for any other set of pairwise non-commuting elements y in g, then x is said to be a maximal subset of pairwise non-commuting elements. in this paper we determine the cardinality of a maximal subset of pairwise non-commuting elements in any non-abelian...

This paper investigates the optimisation of aggregation functions in the context of computationally complete database programming languages and aims to generalise and provide a unifying formal foundation for previous work. We deene a `fold' operator over collection types in terms of which operations such as selection, projection, join and group-by can be deened, as well as aggregation functions...

Route suggestions for public transportation has been integrated to different mapping services such as Google Maps or Bing Maps. However, those suggestions are often found to be unreliable for the end-users, mainly because of two reasons. Firstly, these route-finding techniques do not consider traffic conditions on the roads. Secondly, routes are generalized for every user, completely ignoring t...

In this work we propose a randomized algorithm to estimate the street-level commuting route using call detail records (CDRs). Our algorithm works in three steps. First, for each individual, we create perturbations of estimated home and work locations within the cell tower coverage. Second, we identify a route between each pair of both locations through a web mapping service. Finally, we choose ...