Search results for "General Mathematics"

Machine-Independent Characterizations and Complete Problems for Deterministic Linear Time

2002

This article presents two algebraic characterizations and two related complete problems for the complexity class DLIN that was introduced in [E. Grandjean, Ann. Math. Artif. Intell., 16 (1996), pp. 183--236]. DLIN is essentially the class of all functions that can be computed in linear time on a Random Access Machine which uses only numbers of linear value during its computations. The algebraic characterizations are in terms of recursion schemes that define unary functions. One of these schemes defines several functions simultaneously, while the other one defines only one function. From the algebraic characterizations, we derive two complete problems for DLIN under new, very strict, and mac…

The Besov capacity in metric spaces

2016

We study a capacity theory based on a definition of Haj{\l} asz-Besov functions. We prove several properties of this capacity in the general setting of a metric space equipped with a doubling measure. The main results of the paper are lower bound and upper bound estimates for the capacity in terms of a modified Netrusov-Hausdorff content. Important tools are $\gamma$-medians, for which we also prove a new version of a Poincar\'e type inequality.

The mixed general routing polyhedron

2003

[EN] In Arc Routing Problems, ARPs, the aim is to find on a graph a minimum cost traversal satisfying some conditions related to the links of the graph. Due to restrictions to traverse some streets in a specified way, most applications of ARPs must be modeled with a mixed graph. Although several exact algorithms have been proposed, no polyhedral investigations have been done for ARPs on a mixed graph. In this paper we deal with the Mixed General Routing Problem which consists of finding a minimum cost traversal of a given link subset and a given vertex subset of a mixed graph. A formulation is given that uses only one variable for each link (edge or arc) of the graph. Some properties of the…

On set-valued cone absolutely summing maps

2009

Spaces of cone absolutely summing maps are generalizations of Bochner spaces Lp(μ, Y), where (Ω, Σ, μ) is some measure space, 1 ≤ p ≤ ∞ and Y is a Banach space. The Hiai-Umegaki space \( \mathcal{L}^1 \left[ {\sum ,cbf(X)} \right] \) of integrably bounded functions F: Ω → cbf(X), where the latter denotes the set of all convex bounded closed subsets of a separable Banach space X, is a set-valued analogue of L1(μ, X). The aim of this work is to introduce set-valued cone absolutely summing maps as a generalization of \( \mathcal{L}^1 \left[ {\sum ,cbf(X)} \right] \) , and to derive necessary and sufficient conditions for a set-valued map to be such a set-valued cone absolutely summing map. We …

Equivalence of AMLE, strong AMLE, and comparison with cones in metric measure spaces

2006

MSC (2000) Primary: 31C35; Secondary: 31C45, 30C65 In this paper, we study the relationship between p-harmonic functions and absolutely minimizing Lipschitz extensions in the setting of a metric measure space (X, d, µ). In particular, we show that limits of p-harmonic functions (as p →∞ ) are necessarily the ∞-energy minimizers among the class of all Lipschitz functions with the same boundary data. Our research is motivated by the observation that while the p-harmonic functions in general depend on the underlying measure µ, in many cases their asymptotic limit as p →∞ turns out have a characterization that is independent of the measure. c

The Bishop–Phelps–Bollobás theorem for L(L1(μ),L∞[0,1])

2011

Abstract We show that the Bishop–Phelps–Bollobas theorem holds for all bounded operators from L 1 ( μ ) into L ∞ [ 0 , 1 ] , where μ is a σ-finite measure.

CHAOTIC POLYNOMIALS IN SPACES OF CONTINUOUS AND DIFFERENTIABLE FUNCTIONS

2008

AbstractWe construct chaotic m-homogeneous maps acting on $\mathcal{C}^{r}_{\mathtt{+}}( [0,\infty ))$ for any m ≥ 2, $r\in\mathbb{N}\cup\{0\},$ and on the Fréchet spaces $\mathcal{C}_{\mathbb{R}}(\mathbb{R})$ for odd values of m ≥ 3 and $\mathcal{C}_{\mathbb{C}}(\mathbb{R})$ for any m ≥ 2.

Countable recognizability of primitive periodic finitary linear groups

1997

AbsolutelyLexpq - Summing Norms of Diagonal Operators inlr and Limit Orders ofLexp - Summing Operators

2001

We compute the absolutely L – summing norms of the diagonal operators acting on lr (1 ≤ q, r < ∞) and determine the limit orders of the absolutely Lexp – summing operators.

POINTS OF $\varepsilon$ -DIFFERENTIABILITY OF LIPSCHITZ FUNCTIONS FROM ${\bb R}^n$ TO ${\bb R}^{n-1}$

2002

This paper proves that for every Lipschitz function $f:{\bb R}^n\longrightarrow {\bb R}^m,\;m < n$ , there exists at least one point of $\varepsilon$ -differentiability of $f$ which is in the union of all $m$ -dimensional affine subspaces of the form $q_0+{\rm span}\{q_1,q_2,\ldots,q_m\},\;{\rm where}\;q_j(j=0,1,\ldots,m)$ are points in ${\bb R}^n$ with rational coordinates.