Related papers: Counting bounded elements of a number field
We study the Hamiltonian formulation for a parametrized scalar field in a regular bounded spatial region subject to Dirichlet, Neumann and Robin boundary conditions. We generalize the work carried out by a number of authors on parametrized…
We propose new estimates for the frontier of a set of points. They are defined as kernel estimates covering all the points and whose associated support is of smallest surface. The estimates are written as linear combinatio- ns of kernel…
For any positive integer $n$ along with parameters $\alpha$ and $\nu$, we define and investigate $\alpha$-shifted, $\nu$-offset, floor sequences of length $n$. We find exact and asymptotic formulas for the number of integers in such a…
It is shown that the countably infinite dimensional pointed vector space (the vector space equipped with a constant) over a finite field has infinitely many first order definable reducts. This implies that the countable homogeneous…
A procedure for counting the number of eigenvalues of a matrix in a region surrounded by a closed curve is presented. It is based on the application of the residual theorem. The quadrature is performed by evaluating the principal argument…
The aim of this paper is to study the product of $n$ linear forms over function fields. We calculate the maximum value of the minima of the forms with determinant one when $n$ is small. The value is equal to the natural bound given by…
We explore finite-field frameworks for quantum theory and quantum computation. The simplest theory, defined over unrestricted finite fields, is unnaturally strong. A second framework employs only finite fields with no solution to x^2+1=0,…
We consider random fields that can be represented as integrals of deterministic functions with respect to infinitely divisible random measures and show that these random fields are infinitely divisible.
In the first section of this paper we prove a theorem for the number of columns of a rectangular area that are identical to the given one. In the next section we apply this theorem to derive several combinatorial identities by counting…
We develop an approach to finding upper bounds for the number of arithmetic operations necessary for doing harmonic analysis on permutation modules of finite groups. The approach takes advantage of the intrinsic orbital structure of…
We obtain several results concerning the concept of isotypic structures. Namely we prove that any field of finite transcendence degree over a prime subfield is defined by types; then we construct isotypic but not isomorphic structures with…
We prove a lemma that is useful to get upper bounds for the number of partitions without a given subsum. From this we can deduce an improved upper bound for the number of sets represented by the (unrestricted or into unequal parts)…
An original regular approach to constructing special type symmetries for boundary value problems, namely renormgroup symmetries, is presented. Different methods of calculating these symmetries, based on modern group analysis are described.…
We derive bounds on the volume of an inclusion in a body in two or three dimensions when the conductivities of the inclusion and the surrounding body are complex and assumed to be known. The bounds are derived in terms of average values of…
Given a pair of number fields with isomorphic rings of adeles, we construct bijections between objects associated to the pair. For instance we construct an isomorphism of Brauer groups that commutes with restriction. We additionally…
We study well-rounded lattices which come from ideals in quadratic number fields, generalizing some recent results of the first author with K. Petersen. In particular, we give a characterization of ideal well-rounded lattices in the plane…
New features are described for models with multi-particle area-dependent potentials, in any number of dimensions. The corresponding many-body field theories are investigated for classical configurations. Some explicit solutions are given,…
We explicitly compute limit shapes for several grand canonical Gibbs ensembles of partitions of integers. These ensembles appear in models of aggregation and are also related to invariant measures of zero range and coagulation-fragmentation…
Let $G$ be a connected undirected graph on $n$ vertices with no loops but possibly multiedges. Given an arithmetical structure $(\textbf{r}, \textbf{d})$ on $G$, we describe a construction which associates to it a graph $G'$ on $n-1$…
C. F. Gauss discovered a beautiful formula for the number of irreducible polynomials of a given degree over a finite field. Assuming just a few elementary facts in field theory and the exclusion-inclusion formula, we show how one see the…