Related papers: A Geometric Way to Generate Blundon Type Inequalit…
An optimal 3-point quadrature formula of closed type is derived. Various error inequalities are established. Applications in numerical integration are also given.
We establish a determinant formula for the bilinear form associated with the elliptic hypergeometric integrals of type $BC_n$ by studying the structure of $q$-difference equations to be satisfied by them. The determinant formula is proved…
We are concerned with the problem of decomposing the parameter space of a parametric system of polynomial equations, and possibly some polynomial inequality constraints, with respect to the number of real solutions that the system attains.…
We develop a new method for the computation of $(3,3)$-isogenies between principally polarized abelian surfaces. The idea is to work with models in $\mathbb{P}^8$ induced by a symmetric level-$3$ theta structure. In this setting, the action…
We consider a class of baryogenesis models where the Lagrangian in the visible sector is Charge-Parity (CP) invariant and a baryon asymmetry is produced only when quantum statistics is taken into account. The CP symmetry is broken by matter…
Certain many-particle Hardy inequalities are derived in a simple and systematic way using the so-called ground state representation for the Laplacian on a subdomain of $\mathbb{R}^n$. This includes geometric extensions of the standard Hardy…
The construction of Bell inequalities based on Platonic and Archimedean solids (Quantum 4 (2020), 293) is generalized to the case of orbits generated by the action of some finite groups. A number of examples with considerable violation of…
This paper presents a unified metric-based framework for triangle geometric inequalities using barycentric coordinates. By interpreting classical inequalities as squared distances between points(a process termed metricization)we derive and…
The goal of this paper is to provide computational tools able to find a solution of a system of polynomial inequalities. The set of inequalities is reformulated as a system of polynomial equations. Three different methods, two of which…
In this note we show how to construct a number of nonconvex quadratic inequalities for a variety of physics equations appearing in physical design problems. These nonconvex quadratic inequalities can then be used to construct bounds on…
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…
We introduce a geometric formulation of quantum indeterminacy from which the standard uncertainty inequalities emerge as necessary consequences. Our approach is based on convex geometry in phase space and on methods from symplectic…
A solution to the effectiveness problem in Kohn's algorithm for generating subelliptic multipliers is provided for domains that include those given by sums of squares of holomorphic functions (also including infinite sums). These domains…
This paper is devoted to a systematic study of certain geometric integral inequalities which arise in continuum combinatorial approaches to $L^p$-improving inequalities for Radon-like transforms over polynomial submanifolds of intermediate…
Shephard (Canad. J. Math. 26: 302-321, 1974) proved a decomposition theorem for zonotopes yielding a simple formula for their volume. In this note we prove a generalization of this theorem yielding similar formulas for their intrinsic…
Adopting the definition of excedances of type B due to Brenti, we give a type B analogue of the q-derangement polynomials. The connection between q-derangement polynomials and Eulerian polynomials naturally extends to the type B case. Based…
We survey connections of the Grothendieck inequality and its variants to combinatorial optimization and computational complexity.
An algorithm for generating interpolants for formulas which are conjunctions of quadratic polynomial inequalities (both strict and nonstrict) is proposed. The algorithm is based on a key observation that quadratic polynomial inequalities…
We present a general method to deform the inhomogeneous algebras of the $B_n,C_n,D_n$ type, and find the corresponding bicovariant differential calculus. The method is based on a projection from $B_{n+1}, C_{n+1}, D_{n+1}$. For example we…
A Bonnesen-type inequality is a sharp isoperimetric inequality that includes an error estimate in terms of inscribed and circumscribed regions. A kinematic technique is used to prove a Bonnesen-type inequality for the Euclidean sphere…