Related papers: Detecting Zariski Pairs by Algorithms and Computat…
The article contains a survey of our results on weakly commensurable arithmetic and general Zariski-dense subgroups, length-commensurable and isospectral locally symmetric spaces and of related problems in the theory of semi-simple agebraic…
This paper introduces a new systematic algorithm for constructing periodic Euclidean weaving diagrams with combinatorial arguments. It is shown that such a weaving diagram can be considered as a specific type of four-regular periodic planar…
We study the algebraic combinatorics of monomial degenerations of Pl\"ucker forms which is governed by matching fields in the sense of Sturmfels and Zelevinsky. We provide a necessary condition for a matching field to yield a Khovanskii…
In this paper, we present a solution to the problem of the analytic classification of germs of plane curves with several irreducible components. Our algebraic approach follows precursive ideas of Oscar Zariski and as a subproduct allow us…
We compute the presentations of fundamental groups of the complements of a class of rational cuspidal projective plane curves classified by Flenner, Zaidenberg, Fenske and Saito. We use the Zariski-Van Kampen algorithm and exploit the…
We generalize our methodology for computing with Zariski dense subgroups of $\mathrm{SL}(n, \mathbb{Z})$ and $\mathrm{Sp}(n, \mathbb{Z})$, to accommodate input dense subgroups $H$ of $\mathrm{SL}(n, \mathbb{Q})$ and $\mathrm{Sp}(n,…
We present a combinatorial approach to rigorously show the existence of fixed points, periodic orbits, and symbolic dynamics in discrete-time dynamical systems, as well as to find numerical approximations of such objects. Our approach…
Recovering causal structure in the presence of latent variables is an important but challenging task. While many methods have been proposed to handle it, most of them require strict and/or untestable assumptions on the causal structure. In…
Rauzy-type dynamics are group actions on a collection of combinatorial objects. The first and best known example (the Rauzy dynamics) concerns an action on permutations, associated to interval exchange transformations (IET) for the…
In this thesis, we develop algorithms similar to the Gaussian elimination algorithm in symplectic and split orthogonal similitude groups. As an application to this algorithm, we compute the spinor norm for split orthogonal groups. Also, we…
We give a combinatorial characterization of isotropic subspaces in the Orlik- Solomon algebra of a hyperplane arrangement in terms of decorations of its intersection lattice. We then use this characterization to prove a result that relates…
Using a Zariski topology associated to a finite field extensions, we give new proofs and generalize the primitive and normal basis theorems.
We list all the possible fundamental groups of the complements of real conic-line arrangements with two conics which are tangent to each other at two points, with up to two additional lines. For the computations we use the topological local…
In the current paper we show that the dimension of a family $V$ of irreducible reduced curves in a given ample linear system on a toric surface $S$ over an algebraically closed field is bounded from above by $-K_S.C+p_g(C)-1$, where $C$…
We describe a family of new algorithms for finding the canonical image of a set of points under the action of a permutation group. This family of algorithms makes use of the orbit structure of the group, and a chain of subgroups of the…
We present a method for computing the classification groups of topological insulators and superconductors in the presence of $\mathbb{Z}_2^{\times n}$ point group symmetries, for arbitrary natural numbers $n$. Each symmetry class is…
Let A, B, C, D be given finite sets of pairs of n-by-n complex matrices. We describe an algorithm to determine, with finitely many computations, whether there is a single unitary matrix U such that each pair of matrices in A is unitarily…
Causal discovery from observational data is a challenging task that can only be solved up to a set of equivalent solutions, called an equivalence class. Such classes, which are often large in size, encode uncertainties about the orientation…
We present a new probabilistic symbolic algorithm that, given a variety defined in an n-dimensional affine space by a generic sparse system with fixed supports, computes the Zariski closure of its projection to an l-dimensional coordinate…
Estimating causal interactions in complex dynamical systems is an important problem encountered in many fields of current science. While a theoretical solution for detecting the causal interactions has been previously formulated in the…