Related papers: Constant delay Gray code enumeration of ideals and…
The rank decoding problem has been the subject of much attention in this last decade. This problem, which is at the base of the security of public-key cryptosystems based on rank metric codes, is traditionally studied over finite fields.…
This paper aims at providing extremely efficient algorithms for approximate query enumeration on sparse databases, that come with performance and accuracy guarantees. We introduce a new model for approximate query enumeration on classes of…
We present a new upper bound for the orders of derivatives in the Rosenfeld-Groebner algorithm. This algorithm computes a regular decomposition of a radical differential ideal in the ring of differential polynomials over a differential…
We present a fully automated method for the optimal state space reconstruction from univariate and multivariate time series. The proposed methodology generalizes the time delay embedding procedure by unifying two promising ideas in a…
An approach to obtaining a parsimonious polynomial model from time series is proposed. An optimal minimal nonuniform time series embedding schema is used to obtain a time delay kernel. This scheme recursively optimizes an objective…
We develop an experimental algorithm for the exact solving of the maximum independent set problem. The algorithm consecutively finds the maximal independent sets of vertices in an arbitrary undirected graph such that the next such set…
This paper defines and solves a mathematical model for finding robust periodic timetables by proposing an extension of the Periodic Event Scheduling Problem (PESP). In order to model delayed and not nominal travel times already in the…
We present an algorithm that enumerates all the perfect matchings in a given bipartite graph G = (V,E). Our algorithm requires a constant amortized time to visit one perfect matching of G, in contrast to the current fastest algorithm,…
We consider a combinatorial question about searching for an unknown ideal $\mu$ within a known pointed poset $\lambda$. Elements of $\lambda$ may be queried for membership in $\mu$, but at most $k$ positive queries are permitted. We provide…
We prove that every interval order $P$ with no infinite antichain has a Gallai decomposition. That is, $P$ is a lexicographical sum of proper interval orders over a chain, an antichain or a prime interval order. This is a consequence of the…
Join query evaluation with ordering is a fundamental data processing task in relational database management systems. SQL and custom graph query languages such as Cypher offer this functionality by allowing users to specify the order via the…
For any integer $n\geq 1$ a middle levels Gray code is a cyclic listing of all $n$-element and $(n+1)$-element subsets of $\{1,2,\ldots,2n+1\}$ such that any two consecutive subsets differ in adding or removing a single element. The…
We define a scheme for labelling and ordering integral ideals of number fields, including prime ideals as a special case. The order we define depends only on the choice of a monic irreducible integral defining polynomial for each field $K$,…
We present an algorithm that enumerates all the minimal triangulations of a graph in incremental polynomial time. Consequently, we get an algorithm for enumerating all the proper tree decompositions, in incremental polynomial time, where…
Dynamic systems described by differential equations often involve feedback among system components. When there are time delays for components to sense and respond to feedback, delay differential equation (DDE) models are commonly used. This…
A regular path query (RPQ) is a regular expression q that returns all node pairs (u, v) from a graph database that are connected by an arbitrary path labelled with a word from L(q). The obvious algorithmic approach to RPQ-evaluation (called…
We consider path ideals associated to special classes of posets such as tree posets and cycles. We express their property of being sequentially Cohen-Macaulay in terms of the underlying poset. Moreover, monomial ideals, which arise from the…
Given a finite set of arbitrarily distributed points in affine space with arbitrary multiplicity structures, we present an algorithm to compute the reduced Groebner basis of the vanishing ideal under the lexicographic ordering. Our method…
The purpose of this paper is to propose a semi-analytical technique convenient for numerical approximation of solutions of the initial value problem for $p$-dimensional delayed and neutral differential systems with constant, proportional…
In this paper we continue the development of a new technique for computing elimination ideals by substitution which has been called $Z$-separating re-embeddings. Given an ideal $I$ in the polynomial ring $K[x_1,\dots,x_n]$ over a field $K$,…