Related papers: Locally Associated Orders in Real Quadratic Number…
This paper introduces an effective memetic algorithm for the linear ordering problem with cumulative costs. The proposed algorithm combines an order-based recombination operator with an improved forward-backward local search procedure and…
Successive quadratic approximations, or second-order proximal methods, are useful for minimizing functions that are a sum of a smooth part and a convex, possibly nonsmooth part that promotes regularization. Most analyses of iteration…
Partial differential equation-based numerical solution frameworks for initial and boundary value problems have attained a high degree of complexity. Applied to a wide range of physics with the ultimate goal of enabling engineering…
We empirically study sorting in the evolving data model. In this model, a sorting algorithm maintains an approximation to the sorted order of a list of data items while simultaneously, with each comparison made by the algorithm, an…
We give details of a formerly known relation between ternary quadratic forms and quaternion orders through the even Clifford algebra. Based on this and classifications of ternary quadratic forms we give a completely explicit classification…
We demonstrate that for an arbitrary number of identical particles, each defined on a Hilbert-space of arbitrary dimension, there exists a whole ladder of relations of complementarity between local, and every conceivable kind of joint (or…
Let $p\equiv -q \equiv 5\pmod 8$ be two prime integers. In this paper, we investigate the unit groups of the fields $ L_1 =\mathbb{Q}(\sqrt 2, \sqrt{p}, \sqrt{q}, \sqrt{-1} )$ and $ L_1^+=\mathbb{Q}(\sqrt 2, \sqrt{p}, \sqrt{q} )$.…
In this paper we discuss reduced order models for the approximation of parametric eigenvalue problems. In particular, we are interested in the presence of intersections or clusters of eigenvalues. The singularities originating by these…
Numerical data structures for positive dimensional solution sets of polynomial systems are sets of generic points cut out by random planes of complimentary dimension. We may represent the linear spaces defined by those planes either by…
This paper studies the complexity of query evaluation for databases whose relations are partially ordered; the problem commonly arises when combining or transforming ordered data from multiple sources. We focus on queries in a useful…
We describe a deterministic algorithm for finding a generating element of the multiplicative group of the finite field $\mathbb{F}_{p^n}$ where $p$ is a prime. In time polynomial in $p$ and $n$, the algorithm either outputs an element that…
Let $p$ be a prime. We discuss methods of solution of congruences modulo $p^n$ using $p$-adic numbers; these methods are similar to computations with real numbers (local methods). Examples of relations between local and global methods are…
Linking numbers appear in local quantum field theory in the presence of tensor fields, which are closed two-forms on Minkowski space. Given any pair of such fields, it is shown that the commutator of the corresponding intrinsic (gauge…
This paper presents fundamental algorithms for the computational theory of quadratic forms over number fields. In the first part of the paper, we present algorithms for checking if a given non-degenerate quadratic form over a fixed number…
Given an initial placement of a set of rectangles in the plane, we consider the problem of finding a disjoint placement of the rectangles that minimizes the area of the bounding box and preserves the orthogonal order i.e.\ maintains the…
An important issue in Qualitative Spatial Reasoning is the representation of relative direction. In this paper we present simple geometric rules that enable reasoning about relative direction between oriented points. This framework, the…
The most frequently asked question in the $p-$adic lattice models of statistical mechanics is that whether a root of a polynomial equation belongs to domains $\mathbb{Z}_p^{*}, \ \mathbb{Z}_p\setminus\mathbb{Z}_p^{*}, \ \mathbb{Z}_p, \…
In the first part of this paper, we prove that, under some natural non-degeneracy assumptions, the Greedy Parabolic Target-Following Method, based on {\em universal tangent direction} has a favorable local behavior. In view of its global…
Numerous interesting properties in nonlinear systems analysis can be written as polynomial optimization problems with nonconvex sum-of-squares problems. To solve those problems efficiently, we propose a sequential approach of local…
A new class of geometric query problems are studied in this paper. We are required to preprocess a set of geometric objects $P$ in the plane, so that for any arbitrary query point $q$, the largest circle that contains $q$ but does not…