Search results for "combinatoric"
showing 10 items of 1776 documents
Fréchet Spaces of Holomorphic Functions without Copies of l 1
1996
Let X be a Banach space. Let Hw*(X*) the Frechet space whose elements are the holomorphic functions defined on X* whose restrictions to each multiple mB(X*), m = 1,2, …, of the closed unit ball B(X*) of X* are continuous for the weak-star topology. A fundamental system of norms for this space is the supremum of the absolute value of each element of Hw*(X*) in mB(X*), m = 1,2,…. In this paper we construct the bidual of l1 when this space contains no copy of l1. We also show that if X is an Asplund space, then Hw*(X*) can be represented as the projective limit of a sequence of Banach spaces that are Asplund.
On the Unit Ball of Operator-valued H 2-functions
2009
Let X be a complex Banach space and let H 2 (\( \mathbb{D} \), X) denote the space of X-valued analytic functions in the unit disc such that $$ \mathop {sup}\limits_{0 < r < 1} \int_0^{2\pi } {\left\| {F\left( {re^{it} } \right)} \right\|^2 \frac{{dt}} {{2\pi }} < \infty .} $$ It is shown that a function F belongs to the unit ball of H 2 ( \( \mathbb{D} \), X) if and only if there exist f∈H ∞ (\( \mathbb{D} \), X) and ϕ∈H ∞ (\( \mathbb{D} \)) such that $$ \left\| {f\left( z \right)} \right\|^2 + \left| {\varphi \left( z \right)} \right|^2 \leqslant 1 and F\left( z \right) = \frac{{f\left( z \right)}} {{1 - z\varphi \left( z \right)}} $$ for |z| < 1.
Thin Points of Brownian Motion Intersection Local Times
2005
Let \(\ell \) be the projected intersection local time of two independent Brownian paths in \(\mathbb{R}^d \) for d = 2, 3. We determine the lower tail of the random variable \(\ell \)(B(0, 1)), where B(0, 1) is the unit ball. The answer is given in terms of intersection exponents, which are explicitly known in the case of planar Brownian motion. We use this result to obtain the multifractal spectrum, or spectrum of thin points, for the intersection local times.
Right-Justified Characterization for Generating Regular Pattern Avoiding Permutations
2017
ECO-method and its corresponding succession rules allow to recursively define and construct combinatorial objects. The induced generating trees can be coded by corresponding pattern avoiding permutations. We refine succession rules by using succession functions in case when avoided patterns are regular or c-regular. Although regular patterns are hard to be recognized in general, we give a characterization for its right-justified property which is a prerequisite in the definition of the regular pattern. Based on this characterization, we show the (c-)regularity for various classes of permutations avoiding sets of patterns with variable lengths. Last, the technique of succession functions per…
The index of stable critical points
2002
Abstract In this paper we show that in dimension greater or equal than 3 the index of a stable critical point can be any integer. More concretely, given any k∈ Z and n⩾3 we construct a C ∞ vector field on R n with a unique critical point which is stable (in positive and negative time) and has index equal to k. This result extends previous ones on the index of stable critical points.
Games without repetitions on graphs with vertex disjoint cycles
1997
Games without repetitions on graphs with vertex disjoint cycles are considered. We show that the problem finding of the game partition in this class reduces to this problem for trees. A method of finding of the game partition for trees have been given in [2].
A graph associated with the $\pi$-character degrees of a group
2003
Let G be a group and $\pi$ be a set of primes. We consider the set ${\rm cd}^{\pi}(G)$ of character degrees of G that are divisible only by primes in $\pi$. In particular, we define $\Gamma^{\pi}(G)$ to be the graph whose vertex set is the set of primes dividing degrees in ${\rm cd}^{\pi}(G)$. There is an edge between p and q if pq divides a degree $a \in {\rm cd}^{\pi}(G)$. We show that if G is $\pi$-solvable, then $\Gamma^{\pi}(G)$ has at most two connected components.
The number of lifts of a Brauer character with a normal vertex
2011
AbstractIn this paper we examine the behavior of lifts of Brauer characters in p-solvable groups. In the main result, we show that if φ∈IBr(G) has a normal vertex Q and either p is odd or Q is abelian, then the number of lifts of φ is at most |Q:Q′|. As a corollary, we prove that if φ∈IBr(G) has an abelian vertex subgroup Q, then the number of lifts of φ in Irr(G) is at most |Q|.
SELF-ENERGIES AND VERTEX CORRECTIONS WITH TWO FACTORIZING LOOPS
1999
A complete set of factorizing two-loop self-energies and vertex corrections is calculated analytically for arbitrary masses and momenta — including the case of collinear singularities — within the ℛ-functions approach.
A Note on Symmetry in Job Contact Networks
2007
Since the seminal work of Granovetter (1995), the sociological literature highlighted the importance of social relationships, like friends, relatives and acquaintances, as sources of information on jobs in labor markets. Such importance is also confirmed by a number of empirical studies.3 More recently, economists have devoted considerable attention to this topic,4 so that the study of individual and aggregate economic outcomes produced by the presence of social relationships in labor markets is becoming a fruitful research area in economics.