Related papers: Parameterized Resolution with bounded conjunction
This is a survey paper on rainbow sets (another name for ``choice functions''). The main theme is the distinction between two types of choice functions: those having a large (in the sense of belonging to some specified filter, namely closed…
We show that deterministic finite automata equipped with $k$ two-way heads are equivalent to deterministic machines with a single two-way input head and $k-1$ linearly bounded counters if the accepted language is strictly bounded, i.e., a…
The finite satisfiability problem of monadic second order logic is decidable only on classes of structures of bounded tree-width by the classic result of Seese (1991). We prove the following problem is decidable: Input: (i) A monadic second…
This paper studies the unification problem with associative, commutative, and associative-commutative functions mainly from a viewpoint of the parameterized complexity on the number of variables. It is shown that both associative and…
We show the nonequivalence of combinations of several natural geometric restrictions on trapezoid representations of trapezoid orders. Each of the properties unit parallelogram, unit trapezoid and proper parallelogram, unit trapezoid and…
The main objective of this work is to describe a general and original approach for computing an off-line solution for a set of parameters describing the geometry of the domain. That is, a solution able to include information for different…
This paper develops the geometry of locally bounded rational functions on non-singular real algebraic varieties. First various basic geometric and algebraic results regarding these functions are established in any dimension, culminating…
The solutions to a large class of semi-linear parabolic PDEs are given in terms of expectations of suitable functionals of a tree of branching particles. A sufficient, and in some cases necessary, condition is given for the integrability of…
We present a new definition of non-ambiguous trees (NATs) as labelled binary trees. We thus get a differential equation whose solution can be described combinatorially. This yield a new formula for the number of NATs. We also obtain…
In this paper, we construct resolutions of ideals obtained by removing a small number of generators from the generators of $(x_1,\dots,x_n)^d$.
We already know that several problems like the inequivalence of P and EXP as well as the undecidability of the acceptance problem and halting problem relativize. However, relativization is a limited tool which cannot separate other…
In this paper we investigate the separation properties and related bounds of some codes. We tried to obtain a new existence result for $(w_1, w_2)$-separating codes and discuss the "optimality" of the upper bounds. Next we tried to study…
We analyze the list-decodability, and related notions, of random linear codes. This has been studied extensively before: there are many different parameter regimes and many different variants. Previous works have used complementary styles…
In the Colored Clustering problem, one is asked to cluster edge-colored (hyper-)graphs whose colors represent interaction types. More specifically, the goal is to select as many edges as possible without choosing two edges that share an…
We study the tractability of conjunctive query answering for queries with unbounded arity. It is well known that tractability of the problem can be characterised in terms of the queries treewidth under the assumption of bounded arity. We…
We construct parametric families of (monic) reducible polynomials having two roots very close to each other.
We present a theoretical framework for characterizing the geometrical properties of the space of solutions in constraint satisfaction problems, together with practical algorithms for studying this structure on particular instances. We apply…
In the standard set reconciliation problem, there are two parties $A_1$ and $A_2$, each respectively holding a set of elements $S_1$ and $S_2$. The goal is for both parties to obtain the union $S_1 \cup S_2$. In many distributed computing…
We give an explicit isomorphism between the Gassner representation and the first weight level of a representation of quantum sl(2). Then we construct and provide matrices for colored versions of the BKL representation and higher Lawrence's…
In this manuscript, we introduce a family of parametrized non-homogeneous linear complex differential equations on $[1,\infty)$, depending on a complex parameter. We identify a "Rotation number hypothesis" on the non-homogeneous term, which…