Miyamoto involutions in axial algebras of Jordan type half

Nonassociative commutative algebras A, generated by idempotents e whose adjoint operators ad _e : A → A, given by x ? xe, are diagonalizable and have few eigenvalues, are of recent interest. When certain fusion (multiplication) rules between the associated eigenspaces are imposed, the structure of these algebras remains rich yet rather rigid. For example, vertex operator algebras give rise to such algebras. The connection between the Monster algebra and Monster group extends to many axial algebras which then have interesting groups of automorphisms.Axial algebras of Jordan type η are commutative algebras generated by idempotents whose adjoint operators have a minimal polynomial dividing (x-1)x(x-η), where η ? {0, 1} is fixed, with well-defined and restrictive fusion rules. The case of η ≠1/2 was thoroughly analyzed by Hall, Rehren and Shpectorov in a recent paper, in which axial algebras were introduced. Here we focus on the case where η = 1/2, which is less understood and is of a different nature.     

Nonabelian free subgroups in homomorphic images of valued quaternion division algebras

Given a quaternion division algebra a noncentral element is called pure if its square belongs to the center. A theorem of Rowen and Segev (2004) asserts that for any quaternion division algebra of positive characteristic and any pure element the quotient of by the normal subgroup generated by is abelian-by-nilpotent-by-abelian. In this note we construct a quaternion division algebra of characteristic zero containing a pure element such that contains a nonabelian free group. This demonstrates that the situation in characteristic zero is very different.

     

Using fractional primal–dual to schedule split intervals with demands

We consider the problem of scheduling jobs that are given as groups of non-intersecting intervals on the real line. Each job j is associated with a t-interval (which consists of up to t segments, for some t≥1), a demand, d_j[0,1], and a weight, w(j). A feasible schedule is a collection of jobs such that, for every , the total demand of the jobs in the schedule whose t-interval contains s does not exceed 1. Our goal is to find a feasible schedule that maximizes the total weight of scheduled jobs.We present a 6t-approximation algorithm for this problem that uses a novel extension of the primal–dual schema called fractional primal–dual. The first step in a fractional primal–dual r-approximation algorithm is to compute an optimal solution, x^*, of an LP relaxation of the problem. Next, the algorithm produces an integral primal solution x, and a new LP, denoted by P′, that has the same objective function as the original problem, but contains inequalities that may not be valid with respect to the original problem. Moreover, x^* is a feasible solution of P′. The algorithm also computes a solution y to the dual of P′. The solution x is r-approximate, since its weight is bounded by the value of y divided by r.We present a fractional local ratio interpretation of our 6t-approximation algorithm. We also discuss the connection between fractional primal–dual and the fractional local ratio technique. Specifically, we show that the former is the primal–dual manifestation of the latter.     

Scale-free networks on lattices

We suggest a method for embedding scale-free networks, with degree distribution Pk approximately k(-lambda), in regular Euclidean lattices accounting for geographical properties. The embedding is driven by a natural constraint of minimization of the total length of the links in the system. We find that all networks with lambda>2 can be successfully embedded up to a (Euclidean) distance xi which can be made as large as desired upon the changing of an external parameter. Clusters of successive chemical shells are found to be compact (the fractal dimension is df=d), while the dimension of the shortest path between any two sites is smaller than 1: dmin=(lambda-2)/(lambda-1-1/d), contrary to all other known examples of fractals and disordered lattices.     

Reference-wave solutions for high-frequency fields propagating in random media

Ray theory plays an important role in determining the propagation properties of high-frequency fields and their statistical measures in complicated random environments. According to the ray approach, the field at the observer can be synthesized from a variety of field species arriving along multiple ray trajectories resulting from refraction and scattering from boundaries and from scattering centers embedded in the random medium. For computations of the statistical measures, it is desirable therefore to possess a solution for the high-frequency field propagating along an isolated ray trajectory. For this reason, a new reference-wave method was developed to provide an analytic solution of the parabolic-wave equation.     

Observation of vortex-ring "discrete" solitons in 2D photonic lattices

We present the experimental observation of both on-site and off-site vortex-ring solitons of unity topological charge in a nonlinear photonic lattice, along with a theoretical study of their propagation dynamics and stability.     

Observation of elliptic incoherent spatial solitons

We present the first experimental observation of spatially incoherent elliptic solitons. We use partially spatially incoherent light with anisotropic correlation statistics and observe elliptic solitons supported by the photorefractive screening nonlinearity.     

Random-phase solitons in nonlinear periodic lattices

We predict the existence of random phase solitons in nonlinear periodic lattices. These solitons exist when the nonlinear response time is much longer than the characteristic time of random phase fluctuations. The intensity profiles, power spectra, and statistical (coherence) properties of these stationary waves conform to the periodicity of the lattice. The general phenomenon of such solitons is analyzed in the context of nonlinear photonic lattices.     

Hidden neuronal correlations in cultured networks

Utilization of a clustering algorithm on neuronal spatiotemporal correlation matrices recorded during a spontaneous activity of in vitro networks revealed the existence of hidden correlations: the sequence of synchronized bursting events (SBEs) is composed of statistically distinguishable subgroups each with its own distinct pattern of interneuron spatiotemporal correlations. These findings hint that each of the SBE subgroups can serve as a template for coding, storage, and retrieval of a specific information.