Related papers: A new algorithm to classify chiral polytopes with …
The volume of a cyclic polytope can be obtained by forming an iterated integral along a suitable piecewise linear path running through its edges. Different choices of such a path are related by the action of a subgroup of the combinatorial…
In this paper we propose a method that uses Lagrange multipliers and numerical algebraic geometry to find all critical points, and therefore globally solve, polynomial optimization problems. We design a polyhedral homotopy algorithm that…
This paper proves the existence of a chiral map with alternating automorphism group for every hyperbolic type. We present a set of constructions using permutations for when at least one parameter is even, and call on previously known…
We present a novel certified and complete algorithm to compute arrangements of real planar algebraic curves. It provides a geometric-topological analysis of the decomposition of the plane induced by a finite number of algebraic curves in…
We study homomorphism polynomials, which are polynomials that enumerate all homomorphisms from a pattern graph $H$ to $n$-vertex graphs. These polynomials have received a lot of attention recently for their crucial role in several new…
We describe an algorithm for splitting permutation representations of finite group over fields of characteristic zero into irreducible components. The algorithm is based on the fact that the components of the invariant inner product in…
In arithmetic and algebraic geometry, superspecial (s.sp.\ for short) curves are one of the most important objects to be studied, with applications to cryptography and coding theory. If $g \geq 4$, it is not even known whether there exists…
We study finite groups that occur as combinatorial automorphism groups or geometric symmetry groups of convex polytopes. When $\Gamma$ is a subgroup of the combinatorial automorphism group of a convex $d$-polytope, $d\geq 3$, then there…
We give an algorithm to determine if the dynamical system generated by a positive automorphism of the free group can also be generated by a self-induced interval exchange transformation. The algorithm effectively yields the interval…
Determining visibility in planar polygons and arrangements is an important subroutine for many algorithms in computational geometry. In this paper, we report on new implementations, and corresponding experimental evaluations, for two…
The purpose of this note is to present a method for classifying three-dimensional polyhedra in terms of their symmetry groups. This method is constructive and it is described in terms of the conjugation classes of crystallographic groups in…
Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral…
We describe the autotopism group Atp(G) of any abelian group G as being a semidirect product of its automorphism group Aut(G) and G^2. We then provide the subgroup structure of Atp(G) when G is a finite cyclic group.
We describe an algorithm for computing Schur indices of irreducible characters of a finite group $G$, based on computations within $G$ and its subgroups and with their character tables. The algorithm has been implemented within \Magma\ and…
We provide an algorithm that computes a set of generators for any complete ideal in a smooth complex surface. More interestingly, these generators admit a presentation as monomials in a set of maximal contact elements associated to the…
We give an algorithm to compute the following cohomology groups on $U = \C^n \setminus V(f)$ for any non-zero polynomial $f \in \Q[x_1, ..., x_n]$; 1. $H^k(U, \C_U)$, $\C_U$ is the constant sheaf on $U$ with stalk $\C$. 2. $H^k(U, \Vsc)$,…
The class of all quasigroups is covered by six classes: the class of all asymmetric quasigroups and five varieties of quasigroups (commutative, left symmetric, right symmetric, semi-symmetric and totally symmetric). Each of these classes is…
It is shown that a necessary condition for an abstract group G to be the full automorphism group of a Hamiltonian cycle system is that G has odd order or it is either binary, or the affine linear group AGL(1; p) with p prime. We show that…
We give new polynomial-time algorithms for testing isomorphism of a class of groups given by multiplication tables (GpI). Two results (Cannon & Holt, J. Symb. Comput. 2003; Babai, Codenotti & Qiao, ICALP 2012) imply that GpI reduces to the…
Let $G$ be a finitely generated solvable-by-finite linear group. We present an algorithm to compute the torsion-free rank of $G$ and a bound on the Pr\"{u}fer rank of $G$. This yields in turn an algorithm to decide whether a finitely…