Related papers: Computing with small quasigroups and loops

We develop a noncompact version of the Hopf maps based on the split algebras. The split algebras consist of three species: split-complex numbers, split quaternions, and split octonions. They correspond to three noncompact Hopf maps that…

Code loops are Moufang loops constructed from doubly even binary codes. Then, given a code loop L, we ask which doubly even binary code V produces L. In this sense, V is called a representation of L. In this article we define and determine…

We study conjugacy closed loops (CC-loops) and power-associative CC-loops (PACC-loops). If $Q$ is a PACC-loop with nucleus $N$, then $Q/N$ is an abelian group of exponent 12; if in addition $Q$ is finite, then $|Q|$ is divisible by 16 or by…

Technology of data collection and information transmission is based on various mathematical models of encoding. The words "Geometry of information" refer to such models, whereas the words "Moufang patterns" refer to various sophisticated…

In math.GR/0510298, we showed that every loop isotopic to an F-quasigroup is a Moufang loop. Here we characterize, via two simple identities, the class of F-quasigroups which are isotopic to groups. We call these quasigroups FG-quasigroups.…

The bootstrap provides a simple and powerful means of assessing the quality of estimators. However, in settings involving large datasets---which are increasingly prevalent---the computation of bootstrap-based quantities can be prohibitively…

Models for topological quantum computation are based on braiding and fusing anyons (quasiparticles of fractional statistics) in (2+1)-D. The anyons that can exist in a physical theory are determined by the symmetry group of the Hamiltonian.…

The analysis of infeasible subproblems plays an import role in solving mixed integer programs (MIPs) and is implemented in most major MIP solvers. There are two fundamentally different concepts to generate valid global constraints from…

We use the mathematical structure of group algebras and $H^{+}$-algebras for describing certain problems concerning the quantum dynamics of systems of angular momenta, including also the spin systems. The underlying groups are ${\rm SU}(2)$…

In this paper we show that the nth quasitopological homotopy group of a topological space is isomorphic to (n-1)th quasitopological homotopy group of its loop space and by this fact we obtain some results about quasitopological homotopy…

Learning from Label Proportions (LLP) is a learning problem where only aggregate level labels are available for groups of instances, called bags, during training, and the aim is to get the best performance at the instance-level on the test…

The excessiveness of integration-by-part (IBP) identities is discussed. The Lie-algebraic structure of the IBP identities is used to reduce the number of the IBP equations to be considered. It is shown that Lorentz-invariance (LI)…

We present an improved version of our program package oneloop which -- written as a package for MAPLE -- solves one-loop Feynman integrals. The package is calculating one-, two- and three-point functions both algebraically and numerically…

In this paper we describe two bootstrap methods for massive data sets. Naive applications of common resampling methodology are often impractical for massive data sets due to computational burden and due to complex patterns of inhomogeneity.…

We present a novel relaxation framework for general mixed-integer nonlinear programming (MINLP) grounded in computational geometry. Our approach constructs polyhedral relaxations by convexifying finite sets of strategically chosen points,…

Using the computational algebra system GAP (http://www.gap-system.org) and the GAP package LAGUNA (http://www.cs.st-andrews.ac.uk/~alexk/laguna.htm), we checked that all 2-groups of order not greater than 32 are determined by normalized…

Navigating rigid body objects through crowded environments can be challenging, especially when narrow passages are presented. Existing sampling-based planners and optimization-based methods like mixed integer linear programming (MILP)…

The isomorphism problem for centrally nilpotent loops can be tackled by methods of cohomology. We develop tools based on cohomology and linear algebra that either lend themselves to direct count of the isomorphism classes (notably in the…

This volume contains the proceedings of the 13th International Colloquium on Implementation of Constraint and LOgic Programming Systems (CICLOPS 2013), held in Istanbul, Turkey during August 25, 2013. CICLOPS is a well established line of…

Optimization over the embedded submanifold defined by constraints $c(x) = 0$ has attracted much interest over the past few decades due to its wide applications in various areas. Plenty of related optimization packages have been developed…