Related papers: On number fields with nontrivial subfields
We show that the height of a variety over a finitely generated field of characteristic zero can be written as an integral of local heights over the set of places of the field. This allows us to apply our previous work on toric varieties and…
We study the algebraic connectivity for several classes of random semi-regular graphs. For large random semi-regular bipartite graphs, we explicitly compute both their algebraic connectivity and as well as the full spectrum distribution.…
To what extent does the maximal subfield spectrum of a division algebra determine the isomorphism class of that algebra? It has been shown that over some fields a quaternion division algebra's isomorphism class is largely if not entirely…
Consider an isotropic spherical Gaussian random field T with values in R^{d}. We investigate two problems: (i) When is the level set T^{-1}(t) nonempty with positive probability for any t\in R^{d} ? (ii) If the level set is nonempty, what…
We construct small models of number fields and deduce a better bound for the number of number fields of given degree and bounded discriminant.
In the present paper a behavior of the "average case" approximation complexity for d-parametric random fields of tensor-type is studied. It was shown in [Lifshits and Tulyakova, 2006] that for a given approximation accuracy level the…
Regular groups and fields are common generalizations of minimal and quasi-minimal groups and fields, so the conjectures that minimal or quasi-minimal fields are algebraically closed have their common generalization to the conjecture that…
A complex harmonic polynomial is the sum of a complex polynomial and a conjugated complex polynomial, of degrees $n$ and $m$ respectively. Li and Wei (2009) presented a formula for the expected number of zeros of a random harmonic…
The number of non-isomorphic cubic fields L sharing a common discriminant d(L) = d is called the multiplicity m = m(d) of d. For an assigned value of d, these fields are collected in a multiplet M(d) = (L(1) ,..., L(m)). In this paper, the…
Over a field of characteristic zero, it is clear that a polynomial of the form (X-a)^d has a non-trivial common factor with each of its d-1 first derivatives. The converse has been conjectured by Casas-Alvero. Up to now there have only been…
The Ciliberto-Di Gennaro conjecture predicts that a nodal hypersurface of degree $d\geq 3$ with at most $2(d-2)(d-1)$ nodes is either factorial, or contains a plane and has at least $(d-1)^2$ nodes, or contains a quadric surface and has…
Gibbs random fields play an important role in statistics, however, the resulting likelihood is typically unavailable due to an intractable normalizing constant. Composite likelihoods offer a principled means to construct useful…
We determine what are the fields of values of the irreducible $p$-height zero characters of all finite groups for $p=2$; we conjecture what they should be for odd primes, and reduce this statement to a problem on blocks of quasi-simple…
Let $F(x_1,...,x_n)$ be a form of degree $d\geq 2$, which produces a geometrically irreducible hypersurface in $\mathbb{P}^{n-1}$. This paper is concerned with the number of rational points on F=0 which have height at most $B$. Whenever…
This is a revised version of ANT-0045. If K is a number field of degree n with discriminant D, if K=Q(a) then H(a)>c(n)|D|^(1/(2n-2)) where H(a) is the height of the minimal polynomial of a. We ask if one can always find a generator a of K…
Let $d \geq 3$ be a fixed integer. We give an asympotic formula for the expected number of spanning trees in a uniformly random $d$-regular graph with $n$ vertices. (The asymptotics are as $n\to\infty$, restricted to even $n$ if $d$ is…
The equational probabilistic spectrum of a finite algebra is the set of probabilities with which equations are satisfied in the algebra. We study algebras with minimal spectrum, that is, spectra consisting only of the values $1$ and…
The problem of classifying tuples of nilpotent matrices over a field under simultaneous conjugation is considered "hopeless". However, for any given matrix order over a finite field, the number of concerned orbits is always finite. This…
We classify the algebraic combinatorial geometries of arbitrary field extensions of transcendence degree greater than 4 and describe their groups of automorphisms. Our results and proofs extend similar results and proofs by Evans and…
For a digraph $D$, the niche hypergraph $NH(D)$ of $D$ is the hypergraph having the same set of vertices as $D$ and the set of hyperedges is \begin{align} E(NH(D)) &= \{e \subseteq V(D) : |e| \geq 2~and~there~exists~v \in V(D)~such~that~e =…