Related papers: Algorithmic construction of Hurwitz maps
This dissertation presents new results on three different themes all related to matroid polytopes. First we investigate properties of Ehrhart polynomials of matroid polytopes, independence matroid polytopes, and polymatroids. We prove that…
The Galois/monodromy group of a family of geometric problems or equations is a subtle invariant that encodes the structure of the solutions. Computing monodromy permutations using numerical algebraic geometry gives information about the…
Due to the significant progress made in the implementation of quantum hardware, efficient methods and tools to design corresponding algorithms become increasingly important. Many of these tools rely on functional representations of certain…
We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…
A new method to represent and approximate rotation matrices is introduced. The method represents approximations of a rotation matrix $Q$ with linearithmic complexity, i.e. with $\frac{1}{2}n\lg(n)$ rotations over pairs of coordinates,…
In the context of Higman embeddings of recursive groups into finitely presented groups we suggest an algorithm which uses Higman operations to explicitly constructs the specific recursively enumerable sets of integer sequences arising…
We define the formal affine Demazure algebra and formal affine Hecke algebra associated to a Kac-Moody root system. We prove the structure theorems of these algebras, hence, extending several result and construction (presentation in terms…
In this paper, we propose a new and simple approach to the approximation algorithms that are modified and improved from our published results. The computational and graphical examples are presented with the aid of Maple procedures.
We construct and study the tropical moduli space \(\mathcal{M}_3^{\mathrm{trop}}\) of degree-$3$ tropical rational maps \(\mathbb{T}\PP^1 \to \mathbb{T}\PP^1\) up to post-composition. Using a combinatorial description in terms of slope…
We introduce a new combinatorial object called tower diagrams and prove fundamental properties of these objects. We also introduce an algorithm that allows us to slide words to tower diagrams. We show that the algorithm is well-defined only…
This is a survey of known algorithms in algebraic topology with a focus on finite simplicial complexes and, in particular, simplicial manifolds. Wherever possible an elementary approach is chosen. This way the text may also serve as a…
We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…
We develop a Thurston-like theory to characterize geometrically finite rational maps, then apply it to study pinching and plumbing deformations of rational maps. We show that in certain conditions the pinching path converges uniformly and…
We develop a new approach to the study of the multipoint loci of holomorphic maps between complex manifolds. We relate the $k$-fold locus to the curvilinear component of the Hilbert scheme of $k$ points on the source space of the map, and…
In mixed characteristic and in equal characteristic $p$ we define a filtration on topological Hochschild homology and its variants. This filtration is an analogue of the filtration of algebraic $K$-theory by motivic cohomology. Its graded…
We exhibit algorithms to compute systems of Hecke eigenvalues for spaces of Hilbert modular forms over a totally real field. We provide many explicit examples as well as applications to modularity and Galois representations.
We seek random versions of some classical theorems on complex approximation by polynomials and rational functions, as well as investigate properties of random compact sets in connection to complex approximation.
In this paper we consider a family of algorithms for approximate implicitization of rational parametric curves and surfaces. The main approximation tool in all of the approaches is the singular value decomposition, and they are therefore…
By complexifying a Hamiltonian system one obtains dynamics on a holomorphic symplectic manifold. To invert this construction we present a theory of real forms which not only recovers the original system but also yields different real…
Given a finitely presented group $G$, Hopf's formula expresses the second integral homology of $G$ in terms of generators and relators. We give an algorithm that exploits Hopf's formula to estimate $H_2(G;k)$, with coefficients in a finite…