Related papers: Optimal lower bounds on the maximal p-negative typ…

One of the main problems in random network coding is to compute good lower and upper bounds on the achievable cardinality of the so-called subspace codes in the projective space $\mathcal{P}_q(n)$ for a given minimum distance. The…

In this paper, lower bounds on the probability of a finite union of events are considered, i.e. $P\left(\bigcup_{i=1}^N A_i\right)$, in terms of the individual event probabilities $\{P(A_i), i=1,\ldots,N\}$ and the sums of the pairwise…

We obtain an asymptotic upper bound for the product of the $p$-parts of the orders of certain composition factors of a finite group acting completely reducibly and faithfully on a finite vector space of order divisible by a prime $p$. An…

Motivated by an influential result of Bourgain and Tzafriri, we consider continuous matrix functions $A:\mathbb{R}\to M_{n\times n}$ and lower $\ell_2$-norm bounds associated with their restriction to certain subspaces. We prove that for…

We define and prove the existence of unique solutions of an asymptotic Plateau problem for spacelike maximal surfaces in the pseudo-hyperbolic space of signature (2, n): the boundary data is given by loops on the boundary at infinity of the…

We provide a sharp lower bound for the perimeter of the inner parallel sets of a convex body $\Omega$. The bound depends only on the perimeter and inradius $r$ of the original body and states that \[|\partial\Omega_t| \geq…

For numerical approximation the reformulation of a PDE as a residual minimisation problem has the advantages that the resulting linear system is symmetric positive definite, and that the norm of the residual provides an a posteriori error…

We consider the problem of bounding away from 0 the minimum value m taken by a polynomial P of Z[X_1,...,X_k] over the standard simplex, assuming that m>0. Recent algorithmic developments in real algebraic geometry enable us to obtain a…

We derive a linear programming bound on the maximum cardinality of error-correcting codes in the sum-rank metric. Based on computational experiments on relatively small instances, we observe that the obtained bounds outperform all…

This article provide new approach to solve P vs NP problem by using cardinality of bases function. About NP-Complete problems, we can divide to infinite disjunction of P-Complete problems. These P-Complete problems are independent of each…

The existence of positive, pointwise decaying at infinity, weak solutions to a fractional $p$-Laplacian problem in the whole space and with singular reaction is established. Truncation arguments, variational methods, as well as suitable a…

A new sequential approach to investigations of structure of metric spaces at infinity is proposed. Criteria for finiteness and boundedness of metric spaces at infinity are found.

We show that there are shape-independent upper bounds to the extinction cross section per unit volume of randomly oriented nanoparticles, given only material permittivity. Underlying the limits are restrictive sum rules that constrain the…

In recent years some near-optimal estimates have been established for certain sum-product type estimates. This paper gives some first extremal results which provide information about when these bounds may or may not be tight. The main tool…

We introduce a novel technique for proving global strong discrete maximum principles for finite element discretizations of linear and semilinear elliptic equations for cases when the common, matrix-based sufficient conditions are not…

We derive distributional limits for empirical transport distances between probability measures supported on countable sets. Our approach is based on sensitivity analysis of optimal values of infinite dimensional mathematical programs and a…

We consider weighted Hardy inequalities involving the distance function to the boundary of a domain in the $N$-dimensional Euclidean space with nonempty boundary. We give a lower bound for the corresponding best Hardy constant for a domain…

We prove lower bounds on the error incurred when approximating any oscillating function using piecewise polynomial spaces. The estimates are explicit in the polynomial degree and have optimal dependence on the meshwidth and frequency when…

We investigate conditions under which a co-computably enumerable closed set in a computable metric space is computable and prove that in each locally computable computable metric space each co-computably enumerable compact manifold with…

In this note we propose a min-max theory for embedded hypersurfaces with a fixed boundary and apply it to prove several theorems about the existence of embedded minimal hypersurfaces with a given boundary. A simpler variant of these…