Related papers: Polygon Matching and Indexing Under Affine Transfo…

A method is presented for computing all the affine equivalences between two rational ruled surfaces defined by rational parametrizations that works directly in parametric rational form, i.e. without computing or making use of the implicit…

The number of linear independent algebraic relations among elementary symmetric polynomial functions over finite fields is computed. An algorithm able to find all such relations is described. It is proved that the basis of the ideal of…

Given a probability space $(\Omega,{\mathcal A},P)$, random variables $L,M\colon\Omega\to\mathbb R$ and $g\in L^1(\mathbb R)$ we obtain two characterizations of these $f\in L^1(\mathbb R)$ which are solutions of the inhomogeneous refinement…

Let $W$ denote the $n$-dimensional affine space over the finite field $\mathbb F_q$. We prove here a Bollob\'as-type upper bound in the case of the set of affine subspaces. We give a construction of a pair of families of affine subspaces,…

In spatial databases, incompatibilities often arise due to different choices of origin or unit of measurement (e.g., centimeters versus inches). By representing and querying the data in an affine-invariant manner, we can avoid these…

The space of invariant affine connections on every $3$-Sasakian homogeneous manifold of dimension at least $7$ is described. In particular, the remarkable subspaces of invariant affine metric connections, and the subclass with skew-torsion,…

New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…

For a finite $\mathbb{Z}$-algebra $R$, i.e., for a $\mathbb{Z}$-algebra which is a finitely generated $\mathbb{Z}$-module, we assume that $R$ is explicitly given by a system of $\mathbb{Z}$-module generators $G$, its relation module ${\rm…

We consider the {\it noisy polynomial interpolation problem\/} of recovering an unknown $s$-sparse polynomial $f(X)$ over the ring $\mathbb Z_{p^k}$ of residues modulo $p^k$, where $p$ is a small prime and $k$ is a large integer parameter,…

The classification of CFTs has an important subproblem, namely classifiying the partition functions for WZW theories. This subproblem is intimately connected to the modular behaviour of the characters of affine algebras. This paper…

We consider commutativity equations $F_i F_j =F_j F_i$ for a function $F(x^1, \dots, x^N),$ where $F_i$ is a matrix of the third order derivatives $F_{ikl}$. We show that under certain non-degeneracy conditions a solution $F$ satisfies the…

Matching is a method of the design of experiments. If we had an even number of patients and wanted to form pairs of patients such that their ages, for example, in each pair be as close as possible, we would use nonbipartite matching. Not…

In this paper we present an equivalent statement to the Jacobian conjecture. For a polynomial map F on an affine space of dimension n, we define recursively n finite sequences of polynomials. We give an equivalent condition to the…

In this paper, we provide polynomial-time algorithms for different extensions of the matching counting problem, namely maximal matchings, path matchings (linear forest) and paths, on graph classes of bounded clique-width. For maximal…

The notion of a Weyl module, previously defined for the untwisted affine algebras, is extended here to the twisted affine algebras. We describe an identification of the Weyl modules for the twisted affine algebras with suitably chosen Weyl…

We consider a natural generalization of the classical pattern matching problem: given compressed representations of a pattern p[1..M] and a text t[1..N] of sizes m and n, respectively, does p occur in t? We develop an optimal linear time…

When matching parts of a surface to its whole, a fundamental question arises: Which points should be included in the matching process? The issue is intensified when using isometry to measure similarity, as it requires the validation of…

An important task in the field of sensor technology is the efficient implementation of adaptation procedures of measurements from one sensor to another sensor of identical design. One idea is to use the estimation of an affine…

Recursive partitioning is the core of several statistical methods including CART, random forest, and boosted trees. Despite the popularity of tree based methods, to date, there did not exist methods for combining multiple trees into a…

Let $\A$ be an algebra and let $f(x_1,...,x_d)$ be a multilinear polynomial in noncommuting indeterminates $x_i$. We consider the problem of describing linear maps $\phi:\A\to \A$ that preserve zeros of $f$. Under certain technical…