Related papers: Minimal height companion matrices for Euclid polyn…

Consider the length $L_{MM}^E$ of the minimum matching of N points in d-dimensional Euclidean space. Using numerical simulations and the finite size scaling law $< L_{MM}^E > = \beta_{MM}^E(d) N^{1-1/d}(1+A/N+... )$, we obtain precise…

The h^*-polynomial of a lattice polytope is the numerator of the generating function of the Ehrhart polynomial. Let P be a lattice polytope with h^*-polynomial of degree d and with linear coefficient h^*_1. We show that P has to be a…

Let $M$ be a perfect matching on a set of points in the plane where every edge is a line segment between two points. We say that $M$ is globally maximum if it is a maximum-length matching on all points. We say that $M$ is $k$-local maximum…

Motivated by Stanley's results in \cite{St02}, we generalize the rank of a partition $\lambda$ to the rank of a shifted partition $S(\lambda)$. We show that the number of bars required in a minimal bar tableau of $S(\lambda)$ is max$(o, e +…

Let $\Lambda$ be the space of symmetric functions and $V_k$ be the subspace spanned by the modified Schur functions $\{S_\lambda[X/(1-t)]\}_{\lambda_1\leq k}$. We introduce a new family of symmetric polynomials,…

Euclidean distance matrices (EDM) are matrices of squared distances between points. The definition is deceivingly simple: thanks to their many useful properties they have found applications in psychometrics, crystallography, machine…

We introduce deformations of Kazhdan-Lusztig elements and specialised nonsymmetric Macdonald polynomials, both of which form a distinguished basis of the polynomial representation of a maximal parabolic subalgebra of the Hecke algebra. We…

We study similarity classes of point configurations in $\R^d$. Given a finite collection of points, a well-known question is: How high does the Hausdorff dimension $\hd(E)$ of a compact set $E \subset {\Bbb R}^d$, $d \ge 2$, need to be to…

Let $A_n$ denote the height of cyclotomic polynomial $\Phi_n$, where $n$ is a product of $k$ distinct odd primes. We prove that $A_n \le \epsilon_k\phi(n)^{k^{-1}2^{k-1}-1}$ with $-\log\epsilon_k\sim c2^k$, $c>0$. The same statement is true…

We find the minimal dimension for a truncated polynomial algebra over an arbitrary field for which there exists a "non-thin" subalgebra. Moreover, we discuss examples of subalgebras, and count them in low dimensions.

In this paper we study the lower triangular matrix $\mathbb{K}$-algebra $\Lambda:=\left[\begin{smallmatrix} T & 0 \\ M & U \end{smallmatrix}\right],$ where $U$ and $T$ are basic $\mathbb{K}$-algebras with enough idempotents and $M$ is an…

In this paper we establish three results on small-height zeros of quadratic polynomials over $\overline{\mathbb Q}$. For a single quadratic form in $N \geq 2$ variables on a subspace of $\overline{\mathbb Q}^N$, we prove an upper bound on…

Several recent papers construct auxiliary polynomials to bound the Weil height of certain classes of algebraic numbers from below. Following these techniques, the author gave a general method for introducing auxiliary polynomials to…

This work provides explicit characterizations and formulae for the minimal polynomials of a wide variety of structured $4\times 4$ matrices. These include symmetric, Hamiltonian and orthogonal matrices. Applications such as the complete…

The $k$-means problem is a classic objective for modeling clustering in a metric space. Given a set of points in a metric space, the goal is to find $k$ representative points so as to minimize the sum of the squared distances from each…

In this article, we construct two one-parameter families of properly embedded minimal surfaces in a three-dimensional Lie group $\widetilde{E(2)}$, which is the universal covering of the group of rigid motions of Euclidean plane endowed…

We consider a family of heights defined by the $L_p$ norms of polynomials with respect to the equilibrium measure of a lemniscate for $0 \le p \le \infty$, where $p=0$ corresponds to the geometric mean (the generalized Mahler measure) and…

Consider an $n\times n$ matrix polynomial $P(\lambda)$ and a set $\Sigma$ consisting of $k \le n$ distinct complex numbers. In this paper, a (weighted) spectral norm distance from $P(\lambda)$ to the matrix polynomials whose spectra include…

A set of $k$ orthonormal bases of $\mathbb C^d$ is called mutually unbiased if $|\langle e,f\rangle |^2 = 1/d$ whenever $e$ and $f$ are basis vectors in distinct bases. A natural question is for which pairs $(d,k)$ there exist~$k$ mutually…

In this note we present algorithms for computing Euclidean minima of cubic number fields; in particular, we were able to find all norm-Euclidean cubic number fields with discriminants -999 < d < 10000.