Необходимое условие полноты системы экспонент в прострaнстве квaдрaтично интегрируемых функций со степенным весом

A necessary condition is obtained for the completeness of the system of exponents $$e(\Lambda ) = \left\{ {e^{ - \lambda _n t} :\lambda _n \in \left\{ {z:0 < \operatorname{Re} z < A \in \mathbb{R}^ + ,0 < \operatorname{Im} z < 2\pi } \right\}} \right\}$$ in the space of square integrable functions with the power weight t ^?? , where ?1 < ?? < 0.     

When is a stochastic integral a time change of a diffusion?

We give necessary and sufficient conditions that a time change of ann-dimensional Ito stochastic integralX _t of the form

Using a Table to Make a Generalization

A generalization is a statement that is true about many instances.The following story is aboutmaking a generalization.Francie lives in Phoenix.She has a telephone in her room.She pays for all long-distance callsshe makes.One Sunday she called her cousin Meg in San Diego.As they talked,Francie forgot     

Solving a Problem by Using a Diagram

Sketches and diagrams are sometimes useful in problem solving．For example,four runners are in a one-mile race:A,B,C,and D．Points are awarded only to the person finishing first or sec- ond．The first-place winner gets more points than the second-place winner．How many different arrangements of first-and second-place winner are possible?     

When is a Coalgebra a Generator?

Let C be a coalgebra over a field k. The aim of this paper is to study the following problem : (P) If C is a k-coalgebra such that C is a generator for the category of left comodules, is C a left quasi-co-Frobenius coalgebra ? The converse always holds. We show that if C has a finite coradical series, the answer is positive.     

Draining a polygon—or—rolling a ball out of a polygon

We introduce the problem of draining water (or balls representing water drops) out of a punctured polygon (or a polyhedron) by rotating the shape. For 2D polygons, we obtain combinatorial bounds on the number of holes needed, both for arbitrary polygons and for special classes of polygons. We detail an $O(n^2\log n)$ algorithm that finds the minimum number of holes needed for a given polygon, and argue that the complexity remains polynomial for polyhedra in 3D. We make a start at characterizing the 1-drainable shapes, those that only need one hole.     

Exit Time of a Hyperbolic α-Stable Process from a Halfspace or a Ball

For a hyperbolic α-stable process in the hyperbolic space \(\mathbb {H}^{d}, d\ge 2\), we prove that the mean exit time from a halfspace \(H(a)=\{x_{d}>a\}\subset \mathbb {H}^{d} \) is equal to \(\mathbb {E}^{x} \tau _{H(a)} = c(\alpha , d) \delta ^{\alpha /2}_{H(a)} (x),\) where δ_D(x) is the (hyperbolic) distance of x to D^c. Based on this exact result we provide a sharp estimate of the mean exit time from a hyperbolic ball B(x₀,R) of radius R and center x₀: \(\mathbb {E}^{x}\tau _{B(x_{0},R)}\approx (\delta _{B(x_{0},R)}(x) \tanh R)^{\alpha /2}, x\in \mathbb {H}^{d}\). By usual isomorphism argument the same estimate holds in any other model of real hyperbolic space.     

角a、a/2、2a终边位置的研究报告

(~责审余炯沛)a终边位置一象限二象限三象限一四象限一注释代数表示 Zk兀相似文献   

Turán Number of the Family Consisting of a Blow-up of a Cycle and a Blow-up of a Star

Let F={H₁,...,H_k}(k> 1) be a family of graphs.The Turán number of the family F is the maximum number of edges in an n-vertex {H₁,...,H_k)-free graph,denoted by ex(n,F) or ex(n,{H₁,H₂,...,H_k}).The blow-up of a graph H is the graph obtained from H by replacing each edge in H by a clique of the same size where the new vertices of the cliques are all different.In this paper we determine the Turán number of the family cons...     

On a universal Σ-function over a tree

We obtain a sufficient condition for the absence of any universal ??-function in an admissible set (a hereditarily finite admissible set). We construct a tree T of height 4 such that no universal ??-function exists in the hereditarily finite admissible set ? $\mathbb{F} $ (T) over T.