Related papers: Height bounds for algebraic numbers satisfying spl…
The p-adic description of Higgs mechanism in TGD framework provides excellent predictions for elementary particle and hadrons masses ([email protected] 9410058-62). The gauge group of TGD is just the gauge group of the standard model so…
We study the restricted growth function associated with set partitions, and obtain exact formulas for the number of strong records with height one, the total of record heights over set of partitions, and the number of partitions with a…
Let a and b be algebraic numbers such that exactly one of a and b is an algebraic integer, and let f_t(z):=z^2+t be a family of polynomials parametrized by t. We prove that the set of all algebraic numbers t for which there exist positive…
In this paper we consider the problem of counting algebraic numbers $\alpha$ of fixed degree $n$ and bounded height $Q$ such that the derivative of the minimal polynomial $P_{\alpha}(x)$ of $\alpha$ is bounded, $|P_{\alpha}'(\alpha)| <…
Let $Z$ be a projective geometrically integral algebraic variety. This paper is concerned with estimating the number of rational points on $Z$ which have height at most $B$. The bounds obtained are uniform in varieties of fixed degree and…
Exact mathematical solution of the minimization conditions of scalar the Higgs potential of the Finite Supersymmetric Grand Unification Theory is proposed and extremal field configurations are found. Types of extrema are investigated and…
The main aim of this article is to establish several $p$-numerical radius inequalities via the $(f,g)$-Aluthge transform of Hilbert space operators and operator matrices. Furthermore, various classical numerical radius and norm inequalities…
Existing theoretical stabilization results for linear, hyperbolic multi-dimensional problems are extended to the discretized multi-dimensional problems. In contrast to existing theoretical and numerical analysis in the spatially…
In this paper we give a lower bound for the least distortion embedding of a distance regular graph into Euclidean space. We use the lower bound for finding the least distortion for Hamming graphs, Johnson graphs, and all strongly regular…
Consider the problem of minimizing a lower semi-continuous semi-algebraic function $f \colon \mathbb{R}^n \to \mathbb{R} \cup \{+\infty\}$ on an unbounded closed semi-algebraic set $S \subset \mathbb{R}^n.$ Employing adequate tools of…
An exact, number-conserving solution to the generalized, orbit-dependent pairing problem is derived by introducing an infinite-dimensional algebra. A method for obtaining eigenvalues and eigenvectors of the corresponding Hamiltonian is also…
There exist numerous results in the literature proving that within certain families of totally real number fields, the minimal rank of a universal quadratic lattice over such a field can be arbitrarily large. Kala introduced a technique of…
Consider the polynomial optimization problem whose objective and constraints are all described by multivariate polynomials. Under some genericity assumptions, %% on these polynomials, we prove that the optimality conditions always hold on…
We consider the problem of partitioning the node set of a graph into $k$ sets of given sizes in order to \emph{minimize the cut} obtained using (removing) the $k$-th set. If the resulting cut has value $0$, then we have obtained a vertex…
We find sharp upper and lower bounds for the degree of an algebraic number in terms of the $Q$-dimension of the space spanned by its conjugates. For all but seven nonnegative integers $n$ the largest degree of an algebraic number whose…
For many mixed-integer programming (MIP) problems, high-quality dual bounds can be obtained either through advanced formulation techniques coupled with a state-of-the-art MIP solver, or through semidefinite programming (SDP) relaxation…
The purpose of this work is to generalize, in the context of 1-motives, the $p$-adic height pairings constructed by B. Mazur and J. Tate on abelian varieties. Following their approach, we define a global pairing between the rational points…
A new set of nonlocal boundary conditions are proposed for the higher modes of the 3D inviscid primitive equations. Numerical schemes using the splitting-up method are proposed for these modes. Numerical simulations of the full nonlinear…
In a 2008 paper Ellenberg suggested a strategy to improve the known upper bounds for the $\ell$-torsion part of class groups of number fields of fixed degree $d$. Motivated by this he proposed a question about the number of primitive…
Codes in finite projective spaces equipped with the subspace distance have been proposed for error control in random linear network coding. The resulting so-called \emph{Main Problem of Subspace Coding} is to determine the maximum size…