Related papers: On the complexity of the permanent in various comp…

For a fixed integer $m\ge 1$, let $\mathcal{A}_n^{(m)}$ be the set of permutations $\pi\in S_n$ that avoid the pattern $132$ and satisfy the adjacency bound $|\pi_{i+1}-\pi_i|\le m$ for all $i$. Here, a pattern $132$ means three indices…

The paper proves the equivalence of the notions of nondeterministic and deterministic parameter testing for uniform dense hypergraphs of arbitrary order. It generalizes the result previously known only for the case of simple graphs. By a…

We evaluate the determinant D = det((y_j u_i - x_j v_i)/(l_j - k_i)) as a function of the last sextuple (u,v,k;x,y,l), the result being shown to have a form reproducing the one of the entries of D. ----- Nous calculons le d\'eterminant D =…

We give extensional and intensional characterizations of functional programs with nondeterminism: as structure preserving functions between biorders, and as nondeterministic sequential algorithms on ordered concrete data structures which…

Let $A$ and $B$ be complex numbers, and let $(w_n)_{n\ge0}$ be a sequence of complex numbers with $w_{n+1}=Aw_n-Bw_{n-1}$ for all $n=1,2,3,\ldots$. When $w_0=0$ and $w_1=1$, the sequence $(w_n)_{n\ge0}$ is just the Lucas sequence…

We study determinantal point processes on $\mathbb{C}$ induced by the reproducing kernels of generalized Fock spaces as well as those on the unit disc $\mathbb{D}$ induced by the reproducing kernels of generalized Bergman spaces. In the…

In this paper we study colorings (or tilings) of the two-dimensional grid $\mathbb{Z}^2$. A coloring is said to be valid with respect to a set $P$ of $n\times m$ rectangular patterns if all $n\times m$ sub-patterns of the coloring are in…

We extend our techniques developed in our earlier paper appeared in Computational Complexity, 2017 (preprint: arXiv:1508.00690) to obtain a deterministic polynomial time algorithm for computing the non-commutative rank together with…

Let $X \subset \Bbb P^r$ be a smooth algebraic curve in projective space, over an algebraically closed field of characteristic zero. For each $m \in \Bbb N$, the $m$-flexes of $X$ are defined as the points where the osculating hypersurface…

We consider here the problem of obtaining reliable, consistent information from inconsistent databases -- databases that do not have to satisfy given integrity constraints. We use the notion of consistent query answer -- a query answer…

We study the cohomology of the generic determinantal varieties $M_{m,n}^s = \{ \varphi \in \mathbb C^{m\times n} : \mathrm{rank} \varphi <s \}$, their polar multiplicities, their sections $D_k \cap M_{m,n}^s$ by generic hyperplanes $D_k$ of…

Regular expressions constitute a fundamental notion in formal language theory and are frequently used in computer science to define search patterns. A classic algorithm for these problems constructs and simulates a non-deterministic finite…

Let $X$ be an $(m\times n)$-matrix of indeterminates, and let $J$ be the ideal generated by a set $\mathcal{S}$ of maximal minors of $X$. We construct the linear strand of the resolution of $J$. This linear strand is determined by the…

Inspired by Dickson's classification of regular ternary quadratic forms, we prove that there are no primitive regular $m$-gonal forms when $m$ is sufficiently large. In order to do so, we construct sequences of primes that are inert in a…

We construct the first examples of an algorithmically complex finitely presented residually finite groups and first examples of finitely presented residually finite groups with arbitrarily large (recursive) Dehn function and depth function.…

We give a bound on the number of isolated, essential singularities of determinantal quartic surfaces in 3-space. We also provide examples of different configurations of real singularities on quartic surfaces with a definite Hermitian…

The minimal Kolmogorov complexity of a total computable function that exceeds everywhere all total computable functions of complexity at most $n$, is $2^{n+O(1)}$. If we replace "everywhere" by "for all sufficiently large inputs", the…

Effective computation of resultants is a central problem in elimination theory and polynomial system solving. Commonly, we compute the resultant as a quotient of determinants of matrices and we say that there exists a determinantal formula…

Let $C^{pr}_m$ be the upper semilattice of degrees of computable sets with respect to primitive recursive $m$-reducibility. We prove that the first-order theory of $C^{pr}_m$ is hereditarily undecidable.

Given a nonsingular $n \times n$ matrix of univariate polynomials over a field $\mathbb{K}$, we give fast and deterministic algorithms to compute its determinant and its Hermite normal form. Our algorithms use…