Related papers: Polygon Matching and Indexing Under Affine Transfo…
Let $\mathbb{F}$ be a field of characteristic $p$, and let $UT_n(\mathbb{F})$ be the algebra of $n \times n$ upper triangular matrices over $\mathbb{F}$ with an involution of the first kind. In this paper we describe: the set of all…
Recent work by Forsg{\aa}rd indicates that not every convex lattice polygon arises as the characteristic polygon of an affine dimer or, equivalently, an admissible oriented line arrangement on the torus in general position. We begin the…
The covering of the affine symmetry group, a semidirect product of translations and special linear transformations, in $D \geq 3$ dimensional spacetime is considered. Infinite dimensional spinorial representations on states and fields are…
We produce algorithms to detect whether a complex affine variety computed and presented numerically by the machinery of numerical algebraic geometry corresponds to an associated component of a polynomial ideal.
A basic problem in the study of algebraic morphisms is to determine which sets can be realised as the image of an endomorphism of affine space. This paper extends the results previously obtained by the first author on the question of…
We derive a mixed integer nonlinear programming formulation for the problem of finding a convex polygon with a given number of vertices that is small (diameter at most one) and has maximum perimeter. The formulation is based on a geometric…
It is well known that, using fast algorithms for polynomial multiplication and division, evaluation of a polynomial $F \in \mathbb{C}[x]$ of degree $n$ at $n$ complex-valued points can be done with $\tilde{O}(n)$ exact field operations in…
We introduce the notion of relation type of an affine algebra and prove that it is well defined by using the Jacobi-Zariski exact sequence of Andr\'e-Quillen homology. In particular, the relation type is an invariant of an affine algebraic…
We study the problem of learning a mixture of two subspaces over $\mathbb{F}_2^n$. The goal is to recover the individual subspaces, given samples from a (weighted) mixture of samples drawn uniformly from the two subspaces $A_0$ and $A_1$.…
Symmetry detection can improve various machine learning tasks. In the context of continuous symmetry detection, current state of the art experiments are limited to detecting affine transformations. Under the manifold assumption, we outline…
The Meeting problem for $k\geq 2$ searchers in a polygon $P$ (possibly with holes) consists in making the searchers move within $P$, according to a distributed algorithm, in such a way that at least two of them eventually come to see each…
It is well-known that a polynomial f(z)=a_d z^d(1+o(1)) can be conjugated by a holomorphic map phi to w \mapsto w^d in a neighbourhood of infinity. This map phi is called a B\"ottcher coordinate for f near infinity. In this paper we…
We obtain bounds on the least dimension of an affine space that can contain an $n$-dimensional submanifold without any pairs of parallel or intersecting tangent lines at distinct points. This problem is closely related to the generalized…
Optimal packing of objects in containers is a critical problem in various real-life and industrial applications. This paper investigates the two-dimensional packing of convex polygons without rotations, where only translations are allowed.…
In this paper we study algorithms for tiling problems. We show that the conditions $(T1)$ and $(T2)$ of Coven and Meyerowitz, conjectured to be necessary and sufficient for a finite set $A$ to tile the integers, can be checked in time…
On a $3$D manifold, a Weyl geometry consists of pairs $(g, A) =$ (metric, $1$-form) modulo gauge $\widehat{g} = {\rm e}^{2\varphi} g$, $\widehat{A} = A + {\rm d}\varphi$. In 1943, Cartan showed that every solution to the Einstein-Weyl…
Motivated by recent results of Tao-Ziegler [Discrete Anal. 2016] and Greenfeld-Tao (2022 preprint) on concatenating affine-linear functions along subgroups of an abelian group, we show three results on recovering affine-linearity of…
A pattern is encountered in a word if some infix of the word is the image of the pattern under some non-erasing morphism. A pattern $p$ is unavoidable if, over every finite alphabet, every sufficiently long word encounters $p$. A theorem by…
Let f(x) be a polynomial with integer coefficients, let n be a positive integer, and let p be an odd prime. Then the mapping x-->f(x) sends Z/p^n into Z/p^n. We study the topological structure of this mapping.
We consider how to index strings, trees and graphs for jumbled pattern matching when we are asked to return a match if one exists. For example, we show how, given a tree containing two colours, we can build a quadratic-space index with…