New Vacuum Solutions for Quadratic Metric-Affine Gravity - a Metric Affine Model for the Massless Neutrino?

AMS Subj. Classification: 83C15, 83C35

Nonlinear Bihari Type Integral Inequalities with Maxima

Some new nonlinear integral inequalities that involve the maximum of the unknown scalar function of one variable are solved. The considered inequalities are generalizations of the classical nonlinear integral inequality of Bihari. The importance of these integral inequalities is defined by their wide applications in qualitative investigations of differential equations with "maxima" and it is illustrated by some direct applications.

Development and Implementation of NURBS Models of Quadratic Curves and Surfaces

This article goes into the development of NURBS models of quadratic curves and surfaces. Curves and surfaces which could be represented by one general equation (one for the curves and one for the surfaces) are addressed. The research examines the curves: ellipse, parabola and hyperbola, the surfaces: ellipsoid, paraboloid, hyperboloid, double hyperboloid, hyperbolic paraboloid and cone, and the cylinders: elliptic, parabolic and hyperbolic. Many real objects which have to be modeled in 3D applications possess specific features. Because of this these geometric objects have been chosen. Using the NURBS models presented here, specialized software modules (plug-ins) have been developed for a 3D graphic system. An analysis of their implementation and the primitives they create has been performed.

Quadratic Time Computable Instances of MaxMin and MinMax Area Triangulations of Convex Polygons

We consider the problems of finding two optimal triangulations of a convex polygon: MaxMin area and MinMax area. These are the triangulations that maximize the area of the smallest area triangle in a triangulation, and respectively minimize the area of the largest area triangle in a triangulation, over all possible triangulations. The problem was originally solved by Klincsek by dynamic programming in cubic time [2]. Later, Keil and Vassilev devised an algorithm that runs in O(n^2 log n) time [1]. In this paper we describe new geometric findings on the structure of MaxMin and MinMax Area triangulations of convex polygons in two dimensions and their algorithmic implications. We improve the algorithm’s running time to quadratic for large classes of convex polygons. We also present experimental results on MaxMin area triangulation.

Series in Mittag-Leffler Functions: Inequalities and Convergent Theorems

MSC 2010: 30A10, 30B10, 30B30, 30B50, 30D15, 33E12

Noninear Integral Inequalities Involving Maxima

Снежана Христова, Кремена Стефанова, Лозанка Тренкова - В статията се изучават някои интегрални неравенства, които съдържат макси-мума на неизвестната функция на една променлива. Разглежданите неравенства са обобщения на класическото неравенство на Бихари. Значимостта на тези интегрални неравенства се дълже на широкото им приложение при качественото изследванене на различни свойства на решенията на диференциални уравнения с “максимум” и е илюстрирано с някои директни приложения.

Integral Inequalities and Applications to Partial Differential Equations with “Maxima”

Кремена В. Стефанова - В тази статия са разрешени някои нелинейни интегрални неравенства, които включват максимума на неизвестната функция на две променливи. Разгледаните неравенства представляват обобщения на класическото неравенство на Гронуол-Белман. Значението на тези интегрални неравенства се определя от широките им приложения в качествените изследвания на частните диференциални уравнения с “максимуми” и е илюстрирано чрез някои директни приложения.

A Mixed Integer Quadratic Programming Model for the Low Autocorrelation Binary Sequence Problem

In this paper the low autocorrelation binary sequence problem (LABSP) is modeled as a mixed integer quadratic programming (MIQP) problem and proof of the model’s validity is given. Since the MIQP model is semidefinite, general optimization solvers can be used, and converge in a finite number of iterations. The experimental results show that IQP solvers, based on this MIQP formulation, are capable of optimally solving general/skew-symmetric LABSP instances of up to 30/51 elements in a moderate time. ACM Computing Classification System (1998): G.1.6, I.2.8.

New Hardy-Type Inequalities with Singular Weights

2010 Mathematics Subject Classification: 26D10.

Some Inequalities of the Uniform Ergodicity and Strong Stability of Homogeneous Markov Chains

2000 Mathematics Subject Classification: 60J45, 60K25

On Optimal Quadratic Lagrange Interpolation: Extremal Node Systems with Minimal Lebesgue Constant via Symbolic Computation

ACM Computing Classification System (1998): G.1.1, G.1.2.

Letter to the Editor. Remarks on Some Inequalities for Polynomials

MSC 2010: 30A10, 30C10, 30C80, 30D15, 41A17.

Ostrowski Type Inequalities over Spherical Shells

2000 Mathematics Subject Classification: 26D10, 26D15.

Hyperbolic Fourth-R Quadratic Equation and Holomorphic Fourth-R Polynomials

MSC 2010: 30C10, 32A30, 30G35

Inequalities and Asymptotic Formulae for the Three Parametric Mittag-Leffler Functions

MSC 2010: 33E12, 30A10, 30D15, 30E15