Related papers: Extremality criteria for the supereigenvector spac…
We find all extremisers for the trace theorem on the sphere. We also provide a sharp extension for functions belonging to certain Sobolev spaces with angular regularity.
The Equation Problem in finitely presented groups asks if there exists an algorithm which determines in finite amount of time whether any given equation system has a solution or not. We show that the Equation Problem in central extensions…
We prove a maximality theorem for one-parameter dynamical systems including multiplier one-parameter dynamical systems. Our main result is new even for one-parameter actions on commutative multiplier algebras including the algebra of…
Recently, the conditional maximum-entropy method (abbreviated as C-MaxEnt) has been proposed for selecting priors in Bayesian statistics in a very simple way. Here, it is examined for extreme-value statistics. For the Weibull type as an…
In this paper our aim is to characterize the set of extreme points of the set of all n-dimensional copulas (n > 1). We have shown that a copula must induce a singular measure with respect to Lebesgue measure in order to be an extreme point…
For a given graph G and integers b,f >= 0, let S be a subset of vertices of G of size b+1 such that the subgraph of G induced by S is connected and S can be separated from other vertices of G by removing f vertices. We prove that every…
The necessity of a Maximum Principle arises naturally when one is interested in the study of qualitative properties of solutions to partial differential equations. In general, to ensure the validity of these kind of principles one has to…
We study the problem of estimating the size of maximum matching and minimum vertex cover in sublinear time. Denoting the number of vertices by $n$ and the average degree in the graph by $\bar{d}$, we obtain the following results for both…
The question about maximal size of independent system of word equations is one of the most striking problems in combinatorics on words. Recently, Aleksi Saarela has introduced a new approach to the problem that is based on linear-algebraic…
We introduce a max-plus analogue of the Petrov-Galerkin finite element method to solve finite horizon deterministic optimal control problems. The method relies on a max-plus variational formulation. We show that the error in the sup norm…
To every Gorenstein algebra $A$ of finite dimension greater than 1 over a field ${\Bbb F}$ of characteristic zero, and a projection $\pi$ on its maximal ideal ${\mathfrak m}$ with range equal to the annihilator $\hbox{Ann}({\mathfrak m})$…
In this paper we give sufficient conditions on a compact orbifold with an extremal Kaehler metric to admit a resolution with an extremal Kaehler metric. We also complete the Kaehler constant scalar curvature case.
A geometric framework for metrics of maximal acceleration which is applicable to large proper accelerations is discussed, including a theory of connections associated with the geometry of maximal acceleration. In such a framework it is…
We look for pointwise bounds on a plurisubharmonic function near its singularity point, given the value of its generalized Lelong number with respect to a plurisubharmonic weight. To this end, an extremal problem is considered. In certain…
In this paper, we consider the system $-\Delta u =\lambda (v+1)^p,\;\;-\Delta v = \gamma (u+1)^\theta$ on a smooth bounded domain $\Omega$ in $\mathbb{R}^N$ with the Dirichlet boundary condition $u=v=0$ on $\partial \Omega.$ Here $…
In this article we derive the best possible upper bound for $E[\max{X_i}-\min_i{X_i}]$ under given means and variances on $n$ random variables $X_i$. The random vector $(X_1,...,X_n)$ is allowed to have any dependence structure, provided $E…
We give a high precision polynomial-time approximation scheme for the supremum of any honest n-variate (n+2)-nomial with a constant term, allowing real exponents as well as real coefficients. Our complexity bounds count field operations and…
We give an overview of some properties of Lie algebras generated by at most 5 extremal elements. In particular, for any finite graph {\Gamma} and any field K of characteristic not 2, we consider an algebraic variety X over K whose K-points…
In this paper, we develop new tools and connections for exponential time approximation. In this setting, we are given a problem instance and a parameter $\alpha>1$, and the goal is to design an $\alpha$-approximation algorithm with the…
This note further addresses the global optimization problem for max-plus linear systems considered in [Automatica 119 (2020) 109104]. Firstly, the operations between infinity elemens and real numbers involved in the formulas of solving…