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

In this paper we study holomorphic actions of the complex multiplicative group on complex manifolds around a singular (fixed) point. We prove linearization results for the germ of action and also for the whole action under some conditions…

Finite \'etale covers of a connected scheme $X$ are parametrised by the \'etale fundamental group via the monodromy correspondence. This was generalised to an exodromy correspondence for constructible sheaves, first in the topological…

We study the Galois groups of polynomials arising from a compatible family of representations with big orthogonal monodromy. We show that the Galois groups are usually as large as possible given the constraints imposed on them by a…

We propose variations of the class of hidden monomial cryptosystems in order to make it resistant to all known attacks. We use identities built upon a single bivariate polynomial equation with coefficients in a finite field. Indeed, it can…

The criteria for determining graph isomorphism are crucial for solving graph isomorphism problems. The necessary condition is that two isomorphic graphs possess invariants, but their function can only be used to filtrate and subdivide…

We give a formula for computing the characteristic polynomial for certain hyperplane arrangements in terms of the number of bipartite graphs of given rank and cardinality.

Clique-width is one of the graph complexity measures leading to polynomial special-case algorithms for generally NP-complete problems, e.g. graph colourability. The best two currently known algorithms for verifying c-colourability of graphs…

With every matching in a graph we associate a group called the matching group. We study this group using the theory of non-positively curved cubed complexes. Our approach is formulated in terms of so-called gliding systems.

A polynomial time algorithm which detects all paths and cycles of all lengths in form of vertex pairs (start, finish).

The complexity of graph homomorphisms has been a subject of intense study [11, 12, 4, 42, 21, 17, 6, 20]. The partition function $Z_{\mathbf A}(\cdot)$ of graph homomorphism is defined by a symmetric matrix $\mathbf A$ over $\mathbb C$. We…

Multipath cohomology is a cohomology theory for directed graphs, which is defined using the path poset. The aim of this paper is to investigate combinatorial properties of path posets, and to provide computational tools for multipath…

We introduce the notion of graphic cocircuits and show that a large class of regular matroids with graphic cocircuits belongs to the class of signed-graphic matroids. Moreover, we provide an algorithm which determines whether a cographic…

We investigate the set of Galois conjugates of growth rates of superattracting real quadratic polynomials, following W. Thurston. In particular, we prove that the closure of this set is path-connected and locally connected.

We present a novel approach for improving particle filters for multi-target tracking. The suggested approach is based on drift homotopy for stochastic differential equations. Drift homotopy is used to design a Markov Chain Monte Carlo step…

We consider a Hamiltonian decomposition problem of partitioning a regular graph into edge-disjoint Hamiltonian cycles. It is known that verifying vertex non-adjacency in the 1-skeleton of the symmetric and asymmetric traveling salesperson…

We consider the homotopical dynamics on compact orientable surfaces of positive genus g. We establish a sufficient and necessary algebraic criterion for homotopy classes with infinitely many periodic points of maps on such surfaces in terms…

Motivated by the need for efficient isomorphism tests for finite groups, we present a polynomial-time method for deciding isomorphism within a class of groups that is well-suited to studying local properties of general finite groups. We…

A directed multigraph is said vulnerable if it can generate Braess paradox in Traffic Networks. In this paper, we give a graph-theoretic characterisation of vulnerable directed multigraphs; analogous results appeared in the literature only…

In this article we introduce the notion of projective isomonodromy, which is a special type of monodromy evolving deformation of linear differential equations, based on the example of the Darboux-Halphen equation. We give an algebraic…

I define a "group graph" which encodes the symmetry in a dynamical process on a network. Group graphs extend signed networks, where links are labelled with plus or minus one, by allowing link labels from any group and generalising the…