Related papers: On the composition of finite rotations in $\mathbb…
Uhlenbeck proved that a set of simple elements generates the group of rational loops in GL(n,C) that satisfy the U(n)-reality condition. For an arbitrary complex reductive group, a choice of representation defines a notion of rationality…
A configuration of points and lines is cyclic if it has an automorphism which permutes its points in a full cycle. A closed formula is derived for the number of non-isomorphic connected cyclic configurations of type (v_3), i.e., which have…
We determine for which known finite simple groups $G$ and which primes $p$ the $p$-fusion system of $G$ is simple. This means first collecting together the results that were already known (and correcting two errors made in an earlier study…
Formulae relating one and the same force in two inertial frames of reference are derived directly from the Lorentz transformation of space and time coordinates and relativistic equation for the dynamic law of motion in three dimensions. We…
A partial formula is provided to calculate the smallest number of vertices possible in a quadrangulation on the closed orientable 2-manifold of given genus. This extends the previously known partial formula due to N. Hartsfield and G.…
We discuss the global regularity of 2 dimensional minimal sets that are near a union of two planes, and prove that every global minimal set in R^4 that looks like a union of two almost orthogonal planes at infinity is a cone. The main point…
We study rationality constructions for smooth complete intersections of two quadrics over nonclosed fields. Over the real numbers, we establish a criterion for rationality in dimension four.
We investigate the causal relations in the space of states of almost commutative Lorentzian geometries. We fully describe the causal structure of a simple model based on the algebra $\mathcal{S}(\mathbb{R}^{1,1}) \otimes M_2(\mathbb{C})$,…
In some particular cases we give criteria for morphic sequences to be almost periodic (=uniformly recurrent). Namely, we deal with fixed points of non-erasing morphisms and with automatic sequences. In both cases a polynomial-time algorithm…
Say that a finite group $G$ is mixable if a product of random elements, each chosen independently from two options, can distribute uniformly on $G$. We present conditions and obstructions to mixability. We show that $2$-groups, the…
The general 4D rotation matrix is specialised to the general 3D rotation matrix by equating its leftmost top element (a00) to 1. Its associate matrix of products of the left-hand and right-hand quaternion components is specialised…
We give a short proof -- not relying on ideal classes or the geometry of numbers -- of a known criterion for quadratic orders to possess unique factorization.
We give a necessary and suffcient condition for almost-flat manifolds with cyclic holonomy to admit a Spin structure. Using this condition we find all 4-dimensional orientable almost- flat manifolds with cyclic holonomy that do not admit a…
We give an easily checkable algebraic condition which implies that two elements of a finitely generated free group are members of distinct doubly-twisted conjugacy classes with respect to a pair of homomorphisms. We further show that this…
Computability theory is traditionally conceived as the theoretical basis of informatics. Nevertheless, numerous proposals transcend computability theory, in particular by emphasizing interaction of modules, or components, parts,…
We introduce and prove numerous new results about the orbits of the $T$-fractal billiard. Specifically, in Section 3, we give a variety of sufficient conditions for the existence of a sequence of compatible periodic orbits. In Section 4, we…
The system of four point vortices in the plane has relative equilibria that behave as composite particles, in the case where three of the vortices have strength $-\Gamma/3$ and one of the vortices has strength $\Gamma$. These relative…
We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations -- that is, as quotients of term algebras over decidable sets…
A bijective proof is given for the following theorem: the number of compositions of n into odd parts equals the number of compositions of n + 1 into parts greater than one. Some commentary about the history of partitions and compositions is…
If R is a commutative ring, we prove that every finitely generated module has a pure-composition series with indecomposable factors and any two such series are isomorphic if and only if R is a Bezout ring and a CF-ring.