Related papers: The Light Lexicographic path Ordering
The need to increase data transfer rates constitutes a key challenge in modern information-driven societies. Taking advantage of the transverse spatial modes of light to encode more information is a promising avenue for both classical and…
We use the lexicographic order to define a hierarchy of primal and dual bounds on the optimum of a bounded integer program. These bounds are constructed using lex maximal and minimal feasible points taken under different permutations. Their…
The allowed patterns of a map on a one-dimensional interval are those permutations that are realized by the relative order of the elements in its orbits. The set of allowed patterns is completely determined by the minimal patterns that are…
Many graph problems were first shown to be fixed-parameter tractable using the results of Robertson and Seymour on graph minors. We show that the combination of finite, computable, obstruction sets and efficient order tests is not just one…
We study the problem of enumerating answers of Conjunctive Queries ranked according to a given ranking function. Our main contribution is a novel algorithm with small preprocessing time, logarithmic delay, and non-trivial space usage during…
We are developing a new method for the analysis of queuing systems with heterogeneous in time and space compound (marked) Poisson input flow. The state space of the input flow is embedded in a higher-dimensional space with a homogeneous…
We consider optimal route planning when the objective function is a general nonlinear and non-monotonic function. Such an objective models user behavior more accurately, for example, when a user is risk-averse, or the utility function needs…
We consider colored compositions where only some parts are allowed different colors, depending on their locations in the composition. The counting sequences are obtained through generating functions. Connections to many other combinatorial…
We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…
We investigate the single-source-single-destination "shortest" paths problem in acyclic graphs with ordinal weighted arc costs. We define the concepts of ordinal dominance and efficiency for paths and their associated ordinal levels,…
The purpose of the paper is to provide a characterization of the error of the best polynomial approximation of composite functions in weighted spaces. Such a characterization is essential for the convergence analysis of numerical methods…
We introduce a new approach to LZ77 factorization that uses O(n/d) words of working space and O(dn) time for any d >= 1 (for polylogarithmic alphabet sizes). We also describe carefully engineered implementations of alternative approaches to…
Monotonic semantic path orders and weighted path orders are powerful reduction orders for proving termination of term rewrite systems. In this paper we present their simple unification as reduction orders and reduction pairs. We also…
Multiphase ranking functions ($\mathit{M{\Phi}RFs}$) were proposed as a means to prove the termination of a loop in which the computation progresses through a number of "phases", and the progress of each phase is described by a different…
Spaces of harmonic functions in upper half-space with controlled growth near the boundary are described in terms of multiresolution approximations. The results are applied to prove the law of the iterated logarithm for the oscillation of…
We present a method for the enumeration of restricted words over a finite alphabet. Restrictions are described through the inclusion or exclusion of suitable building blocks used to construct the words by concatenation. Our approach, which…
Symbolic Mathematical tasks such as integration often require multiple well-defined steps and understanding of sub-tasks to reach a solution. To understand Transformers' abilities in such tasks in a fine-grained manner, we deviate from…
A lexicographic maximum of a set $X \subseteq \mathbb{R}^n$ is a vector in $X$ whose smallest component is as large as possible, and subject to that requirement, whose second smallest component is as large as possible, and so on for the…
It is shown that the phase space path integral for a system with arbitrary second class constraints (primary, secondary ...) can be rewritten as a configuration space path integral of the exponent of the Lagrangian action with some local…
In this paper, we propose a new and simple approach to the approximation algorithms that are modified and improved from our published results. The computational and graphical examples are presented with the aid of Maple procedures.