Related papers: Certifying Galois/monodromy Actions via Homotopy G…

We present new computational results for symplectic monodromy groups of hypergeometric differential equations. In particular, we compute the arithmetic closure of each group, sometimes justifying arithmeticity. The results are obtained by…

The simulation of the physical movement of multi-body systems at an atomistic level, with forces calculated from a quantum mechanical description of the electrons, motivates a graph partitioning problem studied in this article. Several…

A circular-arc graph is the intersection graph of arcs of a circle. It is a well-studied graph model with numerous natural applications. A certifying algorithm is an algorithm that outputs a certificate, along with its answer (be it…

Port-Hamiltonian system theory is a well-known framework for the control of complex physical systems. The majority of port-Hamiltonian control design methods base on an explicit input-state-output port-Hamiltonian model for the system under…

We consider some examples of superintegrable system which were recently isolated through a differential Galois group analysis. The identity of these systems is clarified and the corresponding Poisson algebras derived.

In this paper we study the realizability question for commuting graphs of finite groups: Given an undirected graph $X$ is it the commuting graph of a group $G$? And if so, to determine such a group. We seek efficient algorithms for this…

Monodromy in analytic families of smooth complex surfaces yields groups of isotopy classes of orientation preserving diffeomorphisms for each family member X. For all deformation classes of minimal elliptic surfaces with p_g>q=0, we…

Let G be a linear algebraic group, not necessarily connected or reductive, over the field of real numbers R. We describe a method, implemented on computer, to find the first Galois cohomology set H^1(R,G). The output is a list of 1-cocycles…

For a locally finite connected graph $X$ we consider the group $Maps(X)$ of proper homotopy equivalences of $X$. We show that it has a natural Polish group topology, and we propose these groups as an analog of big mapping class groups. We…

In this paper, we describe Galois covers of algebraic curves and their families by using local systems associated to push-forward of sheaves by the structure morphism. More precisely, if $f:C\to Y$, we consider the sheaves $f_*(\C)$. The…

This paper considers the collaborative graph exploration problem in GPS-denied environments, where a group of robots are required to cover a graph environment while maintaining reliable pose estimations in collaborative simultaneous…

We show that a monic univariate polynomial over a field of characteristic zero, with $k$ distinct non-zero known roots, is determined by its $k$ proper leading coefficients by providing an explicit algorithm for computing the multiplicities…

We introduce a novel type of stabilization map on the configuration spaces of a graph, which increases the number of particles occupying an edge. There is an induced action on homology by the polynomial ring generated by the set of edges,…

Using the machinery of etale homotopy theory a' la Artin-Mazur we determine the etale homotopy types of moduli stacks over $\bar{\Q}$ parametrizing families of algebraic curves of genus g greater than 1 endowed with an action of a finite…

A type system combining type application, constants as types, union types (associative, commutative and idempotent) and recursive types has recently been proposed for statically typing path polymorphism, the ability to define functions that…

By a numerical continuation method called a diagonal homotopy we can compute the intersection of two positive dimensional solution sets of polynomial systems. This paper proposes to use this diagonal homotopy as the key step in a procedure…

We contribute to approximate algorithms for the quadratic assignment problem also known as graph matching. Inspired by the success of the fusion moves technique developed for multilabel discrete Markov random fields, we investigate its…

In 2013 Elkies described a method for bounding the transitivity degree of Galois groups. Our goal is to give additional applications of this technique, in particular verifying that the monodromy group of the degree-276 cover defined over a…

We consider efficient route planning for robots in applications such as infrastructure inspection and automated surgical imaging. These tasks can be modeled via the combinatorial problem Graph Inspection. The best known algorithms for this…

Holographic algorithms introduced by Valiant are composed of two ingredients: matchgates, which are gadgets realizing local constraint functions by weighted planar perfect matchings, and holographic reductions, which show equivalences among…