Related papers: On $\alpha$-minimizing hypercones
We construct explicit easily implementable polynomial approximations of sufficiently high accuracy for locally constant functions on the union of disjoint segments. This problem has important applications in several areas of numerical…
We prove minimax theorems for lower semicontinuous functions defined on a Hilbert space. The main tool is the theory of $\Phi$-convex functions and sufficient and necessary conditions for the minimax equality to hold for $\Phi$-convex…
Given a number field, it is an important question in algorithmic number theory to determine all its subfields. If the search is restricted to abelian subfields, one can try to determine them by using class field theory. For this, it is…
We review the present status of QCD corrections to weak decays beyond the leading logarithmic approximation including particle-antiparticle mixing and rare and CP violating decays. After presenting the basic formalism for these calculations…
A simple method is proposed for deforming $A_\infty$-algebras by means of the resolution technique. The method is then applied to the associative algebras of polynomial functions on quantum superspaces. Specifically, by introducing suitable…
Many classification applications require accurate probability estimates in addition to good class separation but often classifiers are designed focusing only on the latter. Calibration is the process of improving probability estimates by…
Cylindrical algebraic decomposition (CAD) is an important tool for the investigation of semi-algebraic sets, with applications in algebraic geometry and beyond. We have previously reported on an implementation of CAD in Maple which offers…
A way to construct and classify the three dimensional polynomially deformed algebras is given and the irreducible representations is presented. for the quadratic algebras 4 different algebras are obtained and for cubic algebras 12 different…
A complex number $\alpha$ is said to satisfy the height reducing property if there is a finite set $F\subset \mathbb{Z}$ such that $\mathbb{Z}[\alpha]=F[\alpha]$, where $\mathbb{Z}$ is the ring of the rational integers. It is easy to see…
A categorical point of view about minimization in subrecursive classes is presented by extending the concept of Symmetric Monoidal Comprehension to that of Distributive Minimization Comprehension. This is achieved by endowing the former…
We develop the theory of generalized bi-Hamiltonian reduction. Applying this theory to a suitable loop algebra we recover a generalized Drinfeld-Sokolov reduction. This gives a way to construct new examples of algebraic Frobenius manifolds.
This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann…
Observing a linear superposition principle, a family of new minimal hypersurfaces in Euclidean space is found, as well as that linear combinations of generalized helicoids induce new algebraic minimal cones of arbitrarily high degree.
In this paper, we present a method of higher-order analysis on bifurcation of small limit cycles around an elementary center of integrable systems under perturbations. This method is equivalent to higher-order Melinikov function approach…
We propose a general method for optimization with semi-infinite constraints that involve a linear combination of functions, focusing on the case of the exponential function. Each function is lower and upper bounded on sub-intervals by…
We develop a new tool, namely polynomial and linear algebraic methods, for studying systems of word equations. We illustrate its usefulness by giving essentially simpler proofs of several hard problems. At the same time we prove extensions…
The main goal of this article is to present several quadratic refinements and reverses of the well known Heinz inequality, for numbers and matrices, where the refining term is a quadratic function in the mean parameters. The proposed idea…
We consider the minimization of non-convex functions that typically arise in machine learning. Specifically, we focus our attention on a variant of trust region methods known as cubic regularization. This approach is particularly attractive…
Quadratic descent of hermitian and skew hermitian forms over division algebras with involution of the first kind in arbitrary characteristic is investigated and a criterion, in terms of systems of quadratic forms, is obtained. A refined…
We show the area-minimality property of all homogeneous area-minimizing hypercones in Euclidean spaces (classified by Lawlor) following Lawson's original idea in his 72' Trans. A.M.S. paper "The equivariant Plateau problem and interior…