Related papers: Imaginary Projections: Complex Versus Real Coeffic…

The projective hull X^ of a subset X in complex projective space P^n is an analogue of the classical polynomial hull of a set in C^n. If X is contained in an affine chart C^n on P^n, then the affine part of X^ is the set of points x in C^n…

We show that the multipole vector decomposition, recently introduced by Copi et al., is a consequence of Sylvester's theorem, and corresponds to the Maxwell's representation. Analyzing it in terms of harmonic polynomials, we show that this…

In semialgebraic geometry, projections play a prominent role. A definable choice is a semialgebraic selection of one point in every fiber of a projection. Definable choices exist by semialgebraic triviality, but their complexity depends…

Let $M$ be a left module over a ring $R$ and $I$ an ideal of $R$. We call $(P, f)$ a (locally)projective $I$-cover of $M$ if $f$ is an epimorphism from $P$ to $M$, $P$ is (locally)projective, $Kerf\subseteq IP$, and whenever $P=Kerf+X$,…

A polynomial ring with rational coefficients is an irreducible representation of Lie algebras of endomorphisms of exterior powers of a infinite countable dimensional $\mathbb{Q}$-vector space. We give an explicit description of it, using…

The degree of a projective subscheme has an upper bound in term of the codimension and the reduction number. If a projective variety has an almost maximal degree, that is, the degree equals to the upper bound minus one, then its Betti table…

Any solid object can be decomposed into a collection of convex polytopes (in short, convexes). When a small number of convexes are used, such a decomposition can be thought of as a piece-wise approximation of the geometry. This…

We study the approximation of holomorphic functions of several complex variables by the ring $\mathcal{P}^S(\mathbb{C}^n)$ of polynomials whose exponents are restricted to a convex cone $\mathbb{R}_+S$ for some compact convex $S\in…

This paper presents a framework for abstracting uncertain or non-polynomial components of dynamical systems using polynomial constraints. This enables the application of polynomial-based analysis tools, such as sum-of-squares programming,…

Let $p$ be a real zero polynomial in $n$ variables. Then $p$ defines a rigidly convex set $C(p)$. We construct a linear matrix inequality of size $n+1$ in the same $n$ variables that depends only on the cubic part of $p$ and defines a…

Linear differential equations with polynomial coefficients over a field $K$ of positive characteristic $p$ with local exponents in the prime field have a basis of solutions in the differential extension $\mathcal{R}_p=K(z_1, z_2,…

A multivalued projection is an idempotent linear relation with invariant domain. We characterize multivalued projections that are operator ranges (called semiclosed) and provide several formulae of them. Moreover, we study the…

For a given graph whose edges are labeled with general real numbers, we consider the set of functions from the vertex set into the Euclidean plane such that the distance between the images of neighbouring vertices is equal to the…

The aim of this note is threefold. The first is to obtain a simple characterization of relative constructible sheaves when the parameter space is projective. The second is to study the relative Fourier-Mukai for relative constructible…

We study imaginary representations of the Khovanov-Lauda-Rouquier algebras of affine Lie type. Irreducible modules for such algebras arise as simple heads of standard modules. In order to define standard modules one needs to have a cuspidal…

The roots of -1 in the set of biquaternions (quaternions with complex components, or complex numbers with quaternion real and imaginary parts) are studied and it is shown that there is an infinite number of non-trivial complexified…

We construct a 2-parameter family of 4-dimensional polytopes with extreme combinatorial structure: In this family, the ``fatness'' of the f-vector gets arbitrarily close to 9, the ``complexity'' (given by the flag vector) gets arbitrarily…

Let n be a positive integer and let p be a prime. We calculate the probability that a random monic polynomial of degree n with coefficients in the ring Z_p of p-adic integers splits over Z_p into linear factors.

This is a straightforward introduction to the properties of polynomials in many variables that do not vanish in the open upper half plane. Such polynomials generalize many of the well-known properties of polynomials with all real roots.

Let $\frak E$ denote be the ring of Eisenstein integers. Let $z\in \mathbb C$ and $p_n,q_n \in \frak E$ be such that $\{p_n/q_n\}$ is the sequence of convergents corresponding to the continued fraction expansion of $z$ with respect to the…