Structure of intersection graphs

<p style="text-align: left;" dir="ltr"> Let <em>G</em> be a finite group and let <em>N</em> be a fixed normal subgroup of <em>G</em>. In this paper, a new kind of graph on <em>G</em>, namely the intersection graph is defined and studied. We use <img src="/public/site/images/ikhsan/equation.png" alt="" width="6" height="4" /> to denote this graph, with its vertices are all normal subgroups of <em>G</em> and two distinct vertices are adjacent if their intersection in <em>N</em>. We show some properties of this graph. For instance, the intersection graph is a simple connected with diameter at most two. Furthermore we give the graph structure of <img src="/public/site/images/ikhsan/equation_(1).png" alt="" width="6" height="4" /> for some finite groups such as the symmetric, dihedral, special linear group, quaternion and cyclic groups. </p>

On Invariant Operations on a Manifold with a Linear Connection and an Orientation

We prove a theorem that describes all possible tensor-valued natural operations in the presence of a linear connection and an orientation in terms of certain linear representations of the special linear group. As an application of this result, we prove a characterization of the torsion and curvature operators as the only natural operators that satisfy the Bianchi identities.

Order Conditions for Sampling the Invariant Measure of Ergodic Stochastic Differential Equations on Manifolds

We derive a new methodology for the construction of high-order integrators for sampling the invariant measure of ergodic stochastic differential equations with dynamics constrained on a manifold. We obtain the order conditions for sampling the invariant measure for a class of Runge–Kutta methods applied to the constrained overdamped Langevin equation. The analysis is valid for arbitrarily high order and relies on an extension of the exotic aromatic Butcher-series formalism. To illustrate the methodology, a method of order two is introduced, and numerical experiments on the sphere, the torus and the special linear group confirm the theoretical findings.

On generic complexity of the subset sum problem in monoids and groups of integer matrix of order two

Generic-case approach to algorithmic problems was suggested by A. Miasnikov, I. Kapovich, P. Schupp and V. Shpilrain in 2003. This approach studies behavior of an algo-rithm on typical (almost all) inputs and ignores the rest of inputs. In this paper, we prove that the subset sum problems for the monoid of integer positive unimodular matrices of the second order, the special linear group of the second order, and the modular group are generically solvable in polynomial time.

Matrix group actions on product of spheres

Let [Formula: see text] be the special linear group over integers and [Formula: see text] [Formula: see text], or [Formula: see text] products of spheres and tori. We prove that any group action of [Formula: see text] on [Formula: see text] by diffeomorphims or piecewise linear homeomorphisms is trivial if [Formula: see text] This confirms a conjecture on Zimmer’s program for these manifolds.

Modular invariant models of leptons at level 7

We consider for the first time level 7 modular invariant flavour models where the lepton mixing originates from the breaking of modular symmetry and couplings responsible for lepton masses are modular forms. The latter are decomposed into irreducible multiplets of the finite modular group Γ7, which is isomorphic to PSL(2, Z7), the projective special linear group of two dimensional matrices over the finite Galois field of seven elements, containing 168 elements, sometimes written as PSL2(7) or Σ(168). At weight 2, there are 26 linearly independent modular forms, organised into a triplet, a septet and two octets of Γ7. A full list of modular forms up to weight 8 are provided. Assuming the absence of flavons, the simplest modular-invariant models based on Γ7 are constructed, in which neutrinos gain masses via either the Weinberg operator or the type-I seesaw mechanism, and their predictions compared to experiment.