Related papers: Minimal height companion matrices for Euclid polyn…
The aim of this paper is to survey and extend results concerning bounds of the Euclidean minima of abelian number fields. In particular, we give upper bounds for the Euclidean minima of abelian number fields of prime power conductor.
In this paper, we give a formula for the number of lattice points in the dilations of Schubert matroid polytopes. As applications, we obtain the Ehrhart polynomials of uniform and minimal matroids as special cases, and give a recursive…
The paper introduces a special case of the Euclidean distance matrix completion problem (edmcp) of interest in statistical data analysis where only the minimal spanning tree distances are given and the matrix completion must preserve the…
The recent years have seen a beautiful breakthrough culminating in a comprehensive understanding of certain scale-invariant properties of $n-1$ dimensional sets across analysis, geometric measure theory, and PDEs. The present paper surveys…
We look at Bohemian matrices, specifically those with entries from $\{-1, 0, {+1}\}$. More, we specialize the matrices to be upper Hessenberg, with subdiagonal entries $\pm1$. Many properties remain after these specializations, some of…
We study the computational complexity of several problems connected with finding a maximal distance-$k$ matching of minimum cardinality or minimum weight in a given graph. We introduce the class of $k$-equimatchable graphs which is an edge…
We construct new special Lagrangian submanifolds in complex Euclidean space using a pair of minimal Legendrian submanifolds in odd-dimensional spheres and certain Lagrangian surface belonging to a family that can be considered as a…
Let $H$ be a $k$-uniform hypergraph on $n$ vertices where $n$ is a sufficiently large integer not divisible by $k$. We prove that if the minimum $(k-1)$-degree of $H$ is at least $\lfloor n/k \rfloor$, then $H$ contains a matching with…
The aim of this paper is to study harmonic polynomials on the quantum Euclidean space E^N_q generated by elements x_i, i=1,2,...,N, on which the quantum group SO_q(N) acts. The harmonic polynomials are defined as solutions of the equation…
We establish the equality of the specialization $E_{w\lambda}(x;q,0)$ of the nonsymmetric Macdonald polynomial $E_{w\lambda}(x;q,t)$ at $t=0$ with the graded character $\mathop{\rm gch} U_{w}^{+}(\lambda)$ of a certain Demazure-type…
Spanners for low dimensional spaces (e.g. Euclidean space of constant dimension, or doubling metrics) are well understood. This lies in contrast to the situation in high dimensional spaces, where except for the work of Har-Peled, Indyk and…
We discuss and compare upper and lower bounds obtained by two different methods for the positive zero of the ultraspherical polynomial $C_{n}^{(\lambda)}$ that is greater than $1$ when $-3/2 < \lambda < -1/2.$ Our first approach uses mixed…
This paper is concerned with a covering problem of Euclidean space by a particular arrangement of cones that are not necessarily full and are allowed to overlap. The problem provides an equivalent geometric reformulation of the solvability…
Matrix polynomials with unitary/doubly stochastic coefficients form the subject matter of this manuscript. We prove that if $P(\lambda)$ is a quadratic matrix polynomial whose coefficients are either unitary matrices or doubly stochastic…
The isometric embeddings $\ell_{2;K}^m\to\ell_{p;K}^n$ ($m\geq 2$, $p\in 2\N$) over a field $K\in{R, C, H}$ are considered, and an upper bound for the minimal $n$ is proved. In the commutative case ($K\neq H$) the bound was obtained by…
We analyze the characteristic polynomial associated to an ellipsoid and another quadric in the context of the contact detection problem. We obtain a necessary and sufficient condition for an efficient method to detect contact. This…
We introduce a graph structure on Euclidean polytopes. The vertices of this graph are the $d$-dimensional polytopes contained in $\mathbb{R}^d$ and its edges connect any two polytopes that can be obtained from one another by either…
We classify $n$-representation infinite algebras $\Lambda$ of type \~A. This type is defined by requiring that $\Lambda$ has higher preprojective algebra $\Pi_{n+1}(\Lambda) \simeq k[x_1, \ldots, x_{n+1}] \ast G$, where $G \leq…
We obtain a characterization on self-orthogonality for a given binary linear code in terms of the number of column vectors in its generator matrix, which extends the result of Bouyukliev et al. (2006). As an application, we give an…
A finite set of the Euclidean space is called an $s$-distance set provided the number of Euclidean distances in the set is $s$. Determining the largest possible $s$-distance set for the Euclidean space of a given dimension is challenging.…