Related papers: No occurrence obstructions in geometric complexity…

In this paper we provide an identity between determinant and generalized matrix function. Also, a criterion of positive semi-definite matrices affirming the permanent dominant conjecture is given. As a consequence, infinitely many infinite…

This survey aims at demonstrating that the structure of precedence constraints plays a tremendous role on the complexity of scheduling problems. Indeed many problems can be NP-hard when considering general precedence constraints, while they…

We study multidimensional configurations (infinite words) and subshifts of low pattern complexity using tools of algebraic geometry. We express the configuration as a multivariate formal power series over integers and investigate the setup…

This article concerns two conjectures of M. P. Murthy. For Murthy's conjecture on complete intersections, the major breakthrough has still been the result proved by Mohan Kumar in 1978. In this article we improve "Mohan Kumar's bound" when…

Let $R$ be a smooth affine algebra over an infinite perfect field $k$. Let $I\subset R$ be an ideal, $\omega_I:(R/I)^n\to I/I^2$ a surjective homomorphism and $Q_{2n}\subset \mathbb{A}^{2n+1}$ be the smooth quadric defined by the equation…

Classifying obstructions to the problem of finding extensions between two fixed modules goes back at least to L. Illusie's thesis. Our approach, following in the footsteps of J. Wise, is to introduce an analogous Grothendieck Topology on…

In 1979 Valiant introduced the complexity class VNP of p-definable families of polynomials, he defined the reduction notion known as p-projection and he proved that the permanent polynomial and the Hamiltonian cycle polynomial are…

In spite of its long history and classical character which goes back even to d'Alembert and Lagrange, the problems of constraints in mechanics of continua is still mysterious and full of misunderstandings. Let us mention the problem of…

This article presents a general solution to the problem of computational complexity. First, it gives a historical introduction to the problem since the revival of the foundational problems of mathematics at the end of the 19th century.…

In this paper, we establish a general relationship between the nonvanishing of GW invariants with the existence of the closed orbits of a Hamiltonian system. As an application, we completely solved the stabilized Weinstein conjecture.

In this paper, we consider the problem of representing a multivariate polynomial as the determinant of a definite (monic) symmetric/Hermitian linear matrix polynomial (LMP). Such a polynomial is known as determinantal polynomial.…

We give a counterexample to a conjecture made by Cigler, Jerman and Wojciechowski stating that all posets are conclusive. We also provide combinatorial characterizations for conclusiveness of finite posets and the existence of outer…

We show that for continuous time dynamical systems described by polynomial differential equations of modest degree (typically equal to three), the following decision problems which arise in numerous areas of systems and control theory…

Many fundamental questions in theoretical computer science are naturally expressed as special cases of the following problem: Let $G$ be a complex reductive group, let $V$ be a $G$-module, and let $v,w$ be elements of $V$. Determine if $w$…

We prove the Box Conjecture for pairs of commuting nilpotent matrices, as formulated by Iarrobino et al [28]. This describes the Jordan type of the dense orbit in the nilpotent commutator of a given nilpotent matrix. Our main tool is the…

We survey various Alexander-type invariants of plane curve complements, with an emphasis on obstructions on the type of groups that can arise as fundamental groups of complements to complex plane curves. Also included are some new…

In (Kabanets, Impagliazzo, 2004) it is shown how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit multilinear polynomial family for arithmetical…

We investigate the Membership Problem for hypergeometric sequences: given a hypergeometric sequence $\langle u_n \rangle_{n=0}^\infty$ of rational numbers and a target $t \in \mathbb{Q}$, decide whether $t$ occurs in the sequence. We show…

We provide topological obstructions to the existence of orbit cylinders of symmetric orbits, for mechanical systems preserved by antisymplectic involutions (e.g. the restricted three-body problem). Such cylinders induce continuous paths…

The aims of this paper are to answer several conjectures and questions about multiplier spectrum of rational maps and to give new proofs of several rigidity theorems in complex dynamics, by combining tools from complex and non-archimedean…