相关论文: Monogenity in totally real extensions of imaginary…

We consider an analogue of Artin's primitive root conjecture for units in real quadratic fields. Given such a nontrivial unit, for a rational prime p which is inert in the field the maximal order of the unit modulo p is p+1. An extension of…

We study orthogonal polynomials on a fully symmetric planar domain $\Omega$ that is generated by a certain triangle in the first quadrant. For a family of weight functions on $\Omega$, we show that orthogonal polynomials that are even in…

We present a new generating algorithm to construct exact non static solutions of the Einstein field equations with two-dimensional inhomogeneity. Infinite dimensional families of $G_1$ inhomogeneous solutions with a self interacting scalar…

Stillman posed a question as to whether the projective dimension of a homogeneous ideal I in a polynomial ring over a field can be bounded by some formula depending only on the number and degrees of the minimal generators of I. More…

We introduce an algorithm that computes explicit class fields of an imaginary quadratic field $K$ for a given modulus $\mathfrak{f}\subset\mathcal{O}_K$ more efficiently than the use of their classical counterparts. Therein, we prove the…

We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…

Taylor's and Laurent's expansions of $G$-monogenic mappings taking values in the algebra of complex quaternion are obtained and singularities of these mappings are classified.

Let $R = k[x_1, \dotsc , x_n]$ denote the standard graded polynomial ring over a field $k$. We study certain classes of equigenerated monomial ideals with the property that the so-called complementary ideal has no linear relations on the…

One of the main contributions which Volker Weispfenning made to mathematics is related to Groebner bases theory. In this paper we present an algorithm for computing all algebraic intermediate subfields in a separably generated unirational…

The orthogonal group acts on the space of several $n\times n$ matrices by simultaneous conjugation. For an infinite field of characteristic different from two, relations between generators for the algebra of invariants are described. As an…

We present an inductive method for constructing the basic spin representations of the double covers of the symmetric groups over fields of any characteristic.

In this paper, we study the reducibility of degenerate principal series of the simple, simply-connected exceptional group of type $E_6$. Furthermore, we calculate the maximal semi-simple subrepresentation and quotient of these…

We give a precise description of how the class group of a number field measures the failure of unique factorization in its ring of integers. Specifically, following ideas of Kummer, we determine the structure of all irreducible…

We characterize the generating function of the number of representations described in the title in terms of the theory of modular forms. Appealing to this characterization we obtain explicit formulas for the representation numbers as…

Methods for calculating lower bounds to the exact energy using the variance of the upper bound energy are discussed and explored. All the matrix elements of the Hamiltonian squared are collected and considered, and those for which no known…

We prove a new formula for the generating function of polynomials counting absolutely stable representations of quivers over finite fields. The case of irreducible representations is studied in more detail.

It is known that for a monomial ideal $I$, the number of minimal generators, $\mu(I^n)$, eventually follows a polynomial pattern for increasing $n$. In general, little is known about the power at which this pattern emerges. Even less is…

We show that an order in a quartic field has fewer than $3000$ essentially different generators as a $\mathbb Z$-algebra (and fewer than $200$ if the discriminant of the order is sufficiently large). This significantly improves the…

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…

We prove an explicit upper bound on the number of real quadratic fields that admit a universal quadratic form of a given rank, thus establishing a density zero statement. More generally, we obtain such a result for totally positive definite…