Related papers: The Light Lexicographic path Ordering
In this paper we give full classification of rank 3 line arrangements in $\mathbb P^2$ (over a field of characteristic 0) that have a minimal logarithmic derivation of degree 3. The classification presents their defining polynomials, up to…
In this paper we explore how light propagates from thin elements into a volume for viewing. In particular, devices that are typically connected with geometric optics, like parallax barriers, differ in treatment with those that obey physical…
We prove that linearizing certain families of polynomial optimization problems leads to new functorial operations in real convex sets. We show that under some conditions these operations can be computed or approximated in ways amenable to…
Let $X$ be a finite set in $Z^d$. We consider the problem of optimizing linear function $f(x) = c^T x$ on $X$, where $c\in Z^d$ is an input vector. We call it a problem $X$. A problem $X$ is related with linear program $\max\limits_{x \in…
In this paper we study the problem of quantizing theories defined over a nonclassical configuration space. If one follows the path-integral approach, the first problem one is faced with is the one of definition of the integral over such…
We consider large-scale traffic assignment problems and develop a path-based compression framework. In particular, we partition paths into major and minor paths according to a set of nominal flows and a prescribed threshold, and retain the…
Marginalization -- summing a function over all assignments to a subset of its inputs -- is a fundamental computational problem with applications from probabilistic inference to formal verification. Despite its computational hardness in…
We introduce an operational rewriting-based semantics for strictly positive nested higher-order (co)inductive types. The semantics takes into account the "limits" of infinite reduction sequences. This may be seen as a refinement and…
The landscape of applications and subroutines relying on shortest path computations continues to grow steadily. This growth is driven by the undeniable success of shortest path algorithms in theory and practice. It also introduces new…
Illumination of scenes is usually generated in computer graphics using polygonal meshes. In this paper, we present a geometric method using projections. Starting from an implicit polynomial equation of a surface in 3-D or a curve in 2-D, we…
We answer a problem posed in (G\'al, Kouck\'y, McKenzie 2008) regarding a restricted model of small-space computation, tailored for solving the GEN problem. They define two variants of "incremental branching programs", the syntactic variant…
Logics with team semantics provide alternative means for logical characterization of complexity classes. Both dependence and independence logic are known to capture non-deterministic polynomial time, and the frontiers of tractability in…
A wide variety of problems in combinatorics and discrete optimization depend on counting the set $S$ of integer points in a polytope, or in some more general object constructed via discrete geometry and first-order logic. We take a tour…
We describe a partial order on finite simplicial complexes. This partial order provides a poset stratification of the product of the Ran space of a metric space and the nonnegative real numbers, through the \v Cech simplicial complex. We…
We consider polynomials of a few linear forms and show how exploit this type of sparsity for optimization on some particular domains like the Euclidean sphere or a polytope. Moreover, a simple procedure allows to detect this form of…
When implementing regular enough functions (e.g., elementary or special functions) on a computing system, we frequently use polynomial approximations. In most cases, the polynomial that best approximates (for a given distance and in a given…
In recent papers we have introduced a method for the study of limit cycles of the Lienard system: dot{x}=y-F(x), dot{y}=-x, where F(x) is an odd polynomial. The method gives a sequence of polynomials R_n(x), whose roots are related to the…
We identify a class of subspaces of ordered spaces $\mathcal L$ for which the following statement holds: If $f:X\to L\in \mathcal L$ is a continuous bijections of a zero-dimensional space $X$, then $f$ can be re-routed via a…
Effective light cones, characterized by Lieb-Robinson bounds, emerge in nonrelativistic local quantum systems. Here, we present several analytical results derived from logarithmic light cones (LLCs). Possible origins of LLCs include the…
This is a survey of results in the enumeration of lattice paths.