Related papers: Computing quadratic function fields with high 3-ra…
This is the second in a series of two papers presenting a solution to Hilbert's 12th problem for real quadratic function fields in positive characteristic, in the sense of proving an analog of the Theorem of Weber-Fueter. We also offer a…
We construct small models of number fields and deduce a better bound for the number of number fields of given degree and bounded discriminant.
Partition functions arise in a variety of settings, including conditional random fields, logistic regression, and latent gaussian models. In this paper, we consider semistochastic quadratic bound (SQB) methods for maximum likelihood…
In this paper we construct number fields ramified at 2 and 3 only, with various moderate-sized non-solvable Galois groups. We construct these fields by specializing three point covers, some from the literature and some new here. The…
We give two algorithms to compute linear determinantal representations of smooth plane curves of any degree over any field. As particular examples, we explicitly give representatives of all equivalence classes of linear determinantal…
We classify all complex quadratic number fields with 2-class group of type (2,2^m) whose Hilbert 2-class fields have class groups of 2-rank equal to 2. These fields all have 2-class field tower of length 2. We still don't know examples of…
The generic structure of 4-point functions of fields residing in indecomposable representations of arbitrary rank is given. The used algorithm is described and we present all results for Jordan-rank $r=2$ and $r=3$ where we make use of…
We give a deterministic algorithm for approximately counting satisfying assignments of a degree-$d$ polynomial threshold function (PTF). Given a degree-$d$ input polynomial $p(x_1,\dots,x_n)$ over $R^n$ and a parameter $\epsilon> 0$, our…
In a previous article the authors determined the best-known upper bound for the cardinality of the image set for several classes of functions, including planar functions. Here, we show that the upper bound cannot be tight for planar…
By making use of our generalization of Barrucand and Cohn's theory of principal factorizations in pure cubic fields $\mathbb{Q}(\sqrt[3]{D})$ and their Galois closures $\mathbb{Q}(\zeta_3,\sqrt[3]{D})$ with 3 possible types to pure quintic…
In this paper we study the following type of functions $f: \mathcal{Q}_{\mathbb{R}_{3}} \to \mathbb{R}_{3}$, where $ \mathcal{Q}_{\mathbb{R}_3}$ is the quadratic cone of the algebra $\mathbb{R}_{3}$. From the fact that it is possible to…
We provide tools to help automate the error analysis of algorithms that evaluate simple functions over the floating-point numbers. The aim is to obtain tight relative error bounds for these algorithms, expressed as a function of the unit…
We construct a computable, computably categorical field of infinite transcendence degree over the rational numbers, using the Fermat polynomials and assorted results from algebraic geometry. We also show that this field has an intrinsically…
We classify all cubic extensions of any field of arbitrary characteristic, up to isomorphism, via an explicit construction involving three fundamental types of cubic forms. We deduce a classification of any Galois cubic extension of a…
Finite element methods usually construct basis functions and quadrature rules for multidimensional domains via tensor products of one-dimensional counterparts. While straightforward, this approach results in integration spaces larger than…
We construct a class of representations of the quadratic R-matrix algebra, given by the reflection equation with the spectral parameter, in terms of certain ordinary difference operators. These operators turn out to act as parameter…
We determine the border rank of each power of any quadratic form in three variables. Since the problem for rank $1$ and rank $2$ quadratic forms can be reduced to determining the rank of powers of binary forms, we primarily focus on…
We study universal quadratic forms over totally real number fields using Dedekind zeta functions. In particular, we prove an explicit upper bound for the rank of universal quadratic forms over a given number field $K$, under the assumption…
In this paper, we give a quadratic Goldreich-Levin algorithm that is close to optimal in the following ways. Given a bounded function $f$ on the Boolean hypercube $\mathbb{F}_2^n$ and any $\varepsilon>0$, the algorithm returns a quadratic…
We obtain upper bounds for the number of monic irreducible polynomials over $\mathbb Z$ of a fixed degree $n$ and a growing height $H$ for which the field generated by one of its roots has a given discriminant. We approach it via counting…