We consider here a variation of Vector Addition Systems where one counter can be tested for zero. We extend the reachability proof for Vector Addition System recently published by Leroux to this model. This provides an alternate, more conceptual proof of the reachability problem that was originally proved by Reinhardt.

We consider the problem of listing faces of the Minkowski sum of several V-polytopes in R. An algorithm for listing all faces of dimension up to j is presented, for any given 0 ≤ j ≤ d − 1. It runs in time polynomial in the sizes of input and output.

Minkowski sums of simplices in Rn form an interesting class of polytopes that seem to emerge in various situations. In this paper we discuss the Minkowski sum of the simplices ∆k−1 in Rn where k and n are fixed, their flags and some of their face lattice structure. In particular, we derive a closed formula for their exponential generating flag function. These polytopes are simple, include both ...

AAA 2

We consider the problem of traveling the contour of the set of all points that are within distance 1 of a connected planar curve arrangement P, forming an embedding of the graph G. We show that if the overall length of P is L, there is a closed roundtrip that visits all points of the contour and has length no longer than 2L + 2. This result carries over in a more general setting: if R is a comp...

In this paper, results from a perception experiment on perceived prosodic boundary strength in spontaneous speech are presented. The analysis of the listeners’ responses reveals a good agreement in rating the strength of prosodic phrase boundaries on a visual analogue scale (VAS), and a strong correlation between perceived boundary strength and pause duration.

This paper makes three original contributions: (1) Explicit closed-form parametric formulas for the boundary of the Minkowski sum and difference of two arbitrarily oriented solid ellipsoids in n-dimensional Euclidean space are presented; (2) Based on this, new closed-form lower and upper bounds for the volume contained in these Minkowski sums and differences are derived in the 2D and 3D cases a...

We investigate a lattice construction method for the Coppersmith technique for finding small solutions of a modular equation. We consider its variant for simultaneous equations and propose a method to construct a lattice by combining lattices for solving single equations. As applications, we consider a new RSA cryptanalyses. Our algorithm can factor an RSA modulus from l ≥ 2 pairs of RSA public...