Related papers: Bounds for D-finite closure properties
We establish necessary and sufficient conditions for the boundedness and compactness of weighted composition operators acting on weighted Dirichlet spaces and determine the spectrum of a certain class of such operators. Our results extend…
We give two lower bounds on the largest order of an arc-transitive graph of diameter two and a given degree.
Consider the Fourier restriction operator associated to a curve in $R^d$, $d\ge 3$. We prove for various classes of curves the endpoint restricted strong type estimate with respect to affine arclength measure on the curve. An essential…
We carry the index theory for manifolds with boundary of B\"ar and Ballmann over to first order differential operators on metric graphs. This approach results in a short proof for the index of such operators. Then the self-adjoint…
This is a survey on upper and lower bounds for finite group actions on bounded surfaces, 3-dimensional handlebodies and closed handles, handlebodies in arbitrary dimensions and finite graphs (the common feature of these objects is that all…
We introduce a new numerical algorithm based on semidefinite programming to efficiently compute bounds on operator dimensions, central charges, and OPE coefficients in 4D conformal and N=1 superconformal field theories. Using our algorithm,…
Let $A$ be an unbounded operator on a Banach space $X$. It is sometimes useful to improve the operator $A$ by extending it to an operator $B$ on a larger Banach space $Y$ with smaller spectrum. It would be preferable to do this with some…
Bounds on the minimum degree and on the number of vertices at- taining it have been much studied for finite edge-/vertex-minimally k- connected/k-edge-connected graphs. We give an overview of the results known for finite graphs, and show…
We study connections between closure operators on an algebra $(A,\Om)$ and congruences on the extended power algebra defined on the same algebra. We use these connections to give an alternative description of the lattice of all subvarieties…
Recently, Bansah and Sehba studied in [3] the boundedness of a family of Hilbert-type integral operators, where they characterized the $L^{p}-L^{q}$ boundedness of the operators for $1\leq p\leq q\leq \infty$. In this paper, we deal with…
We devise an algorithm which, given a bounded automaton A, decides whether the group generated by A is finite. The solution comes from a description of the infinite sequences having an infinite A-orbit using a deterministic finite-state…
We establish some bounds on the number of higher-dimensional partitions by volume. In particular, we give bounds via vector partitions and MacMahon's numbers.
We present new upper bounds on the parameters of batch codes with restricted query size. These bounds are an improvement on the Singleton bound. The techniques for derivations of these bounds are based on the ideas in the literature for…
For a given curve X and divisor class C, we give lower bounds on the degree of a divisor A such that A and A-C belong to specified semigroups of divisors. For suitable choices of the semigroups we obtain (1) lower bounds for the size of a…
This document is an informal bibliography of the papers dealing with distributed approximation algorithms. A classic setting for such algorithms is bounded degree graphs, but there is a whole set of techniques that have been developed for…
We prove sparse bounds for pseudodifferential operators associated to H\"ormander symbol classes. Our sparse bounds are sharp up to the endpoint and rely on a single scale analysis. As a consequence, we deduce a range of weighted estimates…
In this note we consider weighted conditional type operators between different Orlicz spaces and generalized conditional type Holder inequality that we defined in [2]. Then we give some necessary and sufficient conditions for boundedness of…
Recently, deep Convolutional Neural Networks (CNNs) have proven to be successful when employed in areas such as reduced order modeling of parametrized PDEs. Despite their accuracy and efficiency, the approaches available in the literature…
We apply polynomial techniques (linear programming) to obtain lower and upper bounds on the covering radius of spherical designs as function of their dimension, strength, and cardinality. In terms of inner products we improve the lower…
Lower bounds for some explicit decision problems over the complex numbers are given.