Related papers: Computing autotopism groups of partial Latin recta…

An efficient algorithm for computing eigenvectors of a matrix of integers by exact computation is proposed. The components of calculated eigenvectors are expressed as polynomials in the eigenvalue to which the eigenvector is associated, as…

In this paper, we give two algorithms to compute preimages of curves under polynomial endomorphisms. In particular, this gives an efficient way of computing preimages of points. Furthermore, we explain the abstract setting under which one…

We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions…

In this note we give two results. First, if a latin bitrade $(T_1, T_2)$ is primary, thin, separated, and the autotopism group of $T_1$ acts regularly on $T_1$, then $(T_1, T_2)$ may be derived from a group-based construction. Second, if a…

We provide two families of algorithms to compute characteristic polynomials of endomorphisms and norms of isogenies of Drinfeld modules. Our algorithms work for Drinfeld modules of any rank, defined over any base curve. When the base curve…

We present classical sublinear-time algorithms for solving low-rank linear systems of equations. Our algorithms are inspired by the HHL quantum algorithm for solving linear systems and the recent breakthrough by Tang of dequantizing the…

Automorphic Lie Algebras arise in the context of reduction groups introduced in the late 1970s in the field of integrable systems. They are subalgebras of Lie algebras over a ring of rational functions, defined by invariance under the…

We prove that the automorphism group of the dihedral quandle with n elements is isomorphic to the affine group of the integers mod n, and also obtain the inner automorphism group of this quandle. In [9], automorphism groups of quandles (up…

We present an alternate formulation of the partial assignment problem as matching random clique complexes, that are higher-order analogues of random graphs, designed to provide a set of invariants that better detect higher-order structure.…

An analytical-numeric calculation method of extremely complicated integrals is presented. These integrals appear often in magnet soliton theory. The appropriate analytical continuation and a corresponding integration contour allow to reduce…

We develop an algorithm for sampling from the unitary invariant random matrix ensembles. The algorithm is based on the representation of their eigenvalues as a determinantal point process whose kernel is given in terms of orthogonal…

It is a recent observation that entanglement classification for qubits is closely related to local $SL(2,\CC)$-invariants including the invariance under qubit permutations, which has been termed $SL^*$ invariance. In order to single out the…

One of basic difficulties of machine learning is handling unknown rotations of objects, for example in image recognition. A related problem is evaluation of similarity of shapes, for example of two chemical molecules, for which direct…

This article considers stochastic algorithms for efficiently solving a class of large scale non-linear least squares (NLS) problems which frequently arise in applications. We propose eight variants of a practical randomized algorithm where…

The concept of path homotopy has received widely attention in the field of path planning in recent years. In this article, a homotopy invariant based on convex dissection for a two-dimensional bounded Euclidean space is developed, which can…

We analyze the factorization process for lattice maps, searching for integrable cases. The maps were assumed to be at most quadratic in the dependent variables, and we required minimal factorization (one linear factor) after 2 steps of…

Latin tableaux are a generalization of Latin squares, which first appeared in the early 2000's in a paper of Chow, Fan, Goemans, and Vondr\'{a}k. Here, we extend the notion of isotopy, a permutation group action, from Latin squares to Latin…

Simulations that couple different classical molecular models in an adaptive way by changing the number of degrees of freedom on the fly, are available within reasonably consistent theoretical frameworks. The same does not occur when it…

It is well-known that the graph isomorphism problem can be posed as an equivalent problem of determining whether an auxiliary graph structure contains a clique of specific order. However, the algorithms that have been developed so far for…

The orbit problem is at the heart of symmetry reduction methods for model checking concurrent systems. It asks whether two given configurations in a concurrent system (represented as finite strings over some finite alphabet) are in the same…