Related papers: The Conway-Sloane calculus for 2-adic lattices

We consider systems of ODEs with the right hand side being Laurent polynomials in several non-commutative unknowns. In particular, these unknowns could be matrices of arbitrary size. An important example of such a system was proposed by M.…

In the 90's a collection of Plethystic operators were introduced in [3], [7] and [8] to solve some Representation Theoretical problems arising from the Theory of Macdonald polynomials. This collection was enriched in the research that led…

We prove that of all two-dimensional lattices of covolume 1 the hexagonal lattice has asymptotically the fewest distances. An analogous result for dimensions 3 to 8 was proved in 1991 by Conway and Sloane. Moreover, we give a survey of some…

We classify all the symmetric integer bilinear forms of signature (2,1) whose isometry groups are generated up to finite index by reflections. There are 8595 of them up to scale, whose 374 distinct Weyl groups fall into 39 commensurability…

The purpose of this paper is to introduce a bi-intuitionistic sequent calculus and to give proofs of admissibility for its structural rules. The calculus I will present, called SC2Int, is a sequent calculus for the bi-intuitionistic logic…

Stephan (Prove or Disprove 100 Conjectures from the OES, arXiv:math/0409509v4 [math.CO])enumerates a number of conjectures regarding integer sequences contained in Sloane's On-line Encyclopedia of Integer Sequences (N. J. A. Sloane, editor,…

A fairly complete list of Toda-like integrable lattice systems, both in the continuous and discrete time, is given. For each system the Newtonian, Lagrangian and Hamiltonian formulations are presented, as well as the 2x2 Lax representation…

Quaternions, split quaternions, and hybrid numbers are very well-known number systems. These number systems are used to make geometry in Euclidean and Lorentz spaces. These number systems can be obtained with the help of a quadratic form.…

We first describe three algorithms for computing the Lyndon array that have been suggested in the literature, but for which no structured exposition has been given. Two of these algorithms execute in quadratic time in the worst case, the…

A large class of MDS linear codes is constructed. These codes are endowed with an efficient decoding algorithm. Both the definition of the codes and the design of their decoding algorithm only require from Linear Algebra methods, making…

The notion of two-numbers of connected Riemannian manifolds was introduced about 35 years ago in [Un invariant geometrique riemannien, C. R. Acad. Sci. Paris Math. 295 (1982), 389--391] by B.-Y. Chen and T. Nagano. Later, two-numbers have…

This is the "preprint" for a paper that came out in 1998 but for some reason wasn't posted then. Abstract:These lectures are for novices to lattice QCD. They introduce a set of simple ideas and numerical techniques that can be implemented…

Floating point operations are fast, but require continuous effort on the part of the user in order to ensure that the results are correct. This burden can be shifted away from the user by providing a library of exact analysis in which the…

We contribute towards the classification programme for Conway groupoids associated to a $2-(n,4,\lambda)$ design. Our main results improve the known bounds for a hole stabilizer to be primitive, or to contain the alternating group, ${\rm…

Smoothed analysis of complexity bounds and condition numbers has been done, so far, on a case by case basis. In this paper we consider a reasonably large class of condition numbers for problems over the complex numbers and we obtain…

J.P. Levine showed that the Conway polynomial of a link is a product of two factors: one is the Conway polynomial of a knot which is obtained from the link by banding together the components; and the other is determined by the…

We show that if the probabilistic logarithmic-space solver or the deterministic nearly logarithmic-space solver for undirected Laplacian matrices can be extended to solve slightly larger subclasses of linear systems, then they can be use to…

We establish a simple relation between two geometric constructions in number theory: the Conway river of a real indefinite binary quadratic form and the Arnold sail of the corresponding pair of lines.

Using the differential precision methods developed previously by the same authors, we study the p-adic stability of standard operations on matrices and vector spaces. We demonstrate that lattice-based methods surpass naive methods in many…

In the 1990s, J.H. Conway published a combinatorial-geometric method for analyzing integer-valued binary quadratic forms (BQFs). Using a visualization he named the "topograph," Conway revisited the reduction of BQFs and the solution of…