Forbidding just one intersection

Following a conjecture of P. Erdös, we show that if $\text{F}$ is a family of k-subsets of and n-set no two of which intersect in exactly l elements then for k ? 2l + 2 and n sufficiently large |$\text{F}$| ? (_{k ? l ? 1}^{n ? l ? 1}) with equality holding if and only if $\text{F}$ consists of all the k-sets containing a fixed (l + 1)-set. In general we show |$\text{F}$| ? d_kn^{max;{;l,k ? l ? 1};}, where d_k is a constant depending only on k. These results are special cases of more general theorems (Theorem 2.1–2.3).     

On continuous maps between Grassmann manifolds

LetG _n,k denote the Grassmann manifold ofk-planes in ?ⁿ. We show that for any continuous mapf: G _n,k→G_n,l the induced map inZ/2-cohomology is either zero in positive dimensions or has image in the subring generated by w₁(γ_{n, k}), provided 1≤l<k≤[n/2] andn≥k+2l-1. Our main application is to obtain negative results on the existence of equivariant maps between oriented Grassmann manifolds. We also obtain positive results in many cases on the existence of equivariant maps between oriented Grassmann manifolds.     

On the growth order of the rectangular partial sums of multiple non-orthogonal series

Пустьd-натуральное ч исло,Z ^d — множество на боров k=(k ₁, ...,k _d ), состоящих из неотрицательных цел ыхk _j ,Z ₊ ^d =k∈Z ^d :k≧1. Предположи м, что системаf _k (x):k∈Z ₊ ^d ? ?L₂(X,A, μ) и последовател ьностьa _k :k∈Z ₊ ^d . таковы, чт о для всех b∈Z^d и m∈Z ₊ ^d выполн ены неравенства (2) $$\left\| {\sum\limits_{b + 1 \leqq k \leqq b + m} {a_k f_k (x)} } \right\|_2^2 \leqq w^2 (m)\sum\limits_{b + 1 \leqq k \leqq b + m} {a_k^2 } $$ где последовательно сть {w(m): m∈Z ₊ ^d положительн а и не убывает. Например, есл иf _k (х) — квазистационарная система, то для соотве тствующей последовательности {ω(m) (2) имeeт Меcтo ДЛЯ ЛЮбОЙ ПОС ЛеДОВатеЛЬНОСТИ {a_k}. В работе получены оце нки порядка роста пря моугольных частных суммS _m (x)= =∑ a_kf_k(x) при maxmj→∞ как в случ ае {a_k}∈l₂, таки для {a_k}l₂. Эти оценки явля1≦k≦m 1≦j≦d ются новыми даже для о ртогональных кратны х рядов. Показано, что упомяну тые оценки в общем слу чае являются точными.     

On an asymmetric divisor problem with congruence conditions

For fixed positive integersab, natural numbersl ₁k ₁,l ₂k ₂ andn, denote withd _a,b (l ₁,k ₁;l ₂,k ₂;n) the number of all (,)N² with ^{a b} =n,l ₁(modk ₁),l ₂(modk ₂). In the present paper we establish asymptotic formulas for the Dirichlet summatory function ofd _a,b (l ₁,k ₁;l ₂,k ₂;n) with both upper and lower estimates of the error term, all of them uniform in the moduli.     

Spectral decomposition and Gelfand’s theorem

We consider the spectral decomposition of A, the generator of a polynomially bounded n-times integrated group whose spectrum set $\sigma(A)=\{i\lambda_{k};k\in\mathbb{\mathbb{Z}}^{*}\}We consider the spectral decomposition of A, the generator of a polynomially bounded n-times integrated group whose spectrum set s(A)={il_k;k ? \mathbb\mathbbZ^*}\sigma(A)=\{i\lambda_{k};k\in\mathbb{\mathbb{Z}}^{*}\} is discrete and satisfies ?\frac1|l_k|^ld_kⁿ < ￥\sum \frac{1}{|\lambda_{k}|^{\ell}\delta_{k}^{n}}<\infty , where ℓ is a nonnegative integer and d_k=min(\frac|l_k+1-l_k|2,\frac|l_k-1-l_k|2)\delta _{k}=\min(\frac{|\lambda_{k+1}-\lambda _{k}|}{2},\frac{|\lambda _{k-1}-\lambda _{k}|}{2}) . In this case, Theorem 3, we show by using Gelfand’s Theorem that there exists a family of projectors (P_k)_{k ? \mathbb\mathbbZ^*}(P_{k})_{k\in\mathbb{\mathbb{Z}}^{*}} such that, for any x∈D(A ^n+ℓ ), the decomposition ∑P _k x=x holds.     

Spin invariants of multivectors

LetCl(p, q) be a real universal Clifford algebra which is isomorphic to a full matrix algebra ?(2m). In this paper we show that on the linear subspaceCl ^k(p, q) ofk-vectors the determinant can be written as a product of two polynomialsd _i of degreem and that on the subset ofdecomposable k-vectors we have det=±Q ^m for some quadratic formQ. The polynomialsd _i andQ are examples of a spin invariant, the latter being defined as a functionJ:Cl ^k (p,q) → ? for whichJ(sus^?1)=J(u) for allu ∈Cl ^k(p, q) ands ∈Spin(p, q). In the last section we identify the ‘fundamental’ spin invariants on the bivector spacesCl ²(p, p) forp=2 andp=3.     

On Riemann sums and Lebesgue integrals

Call a sequence of positive integers(m _k ) _k=1 ^∞ a chain ifm _k devidesm _k+1 and that it has dimensiond if it is a subset of the set of least common multiples ofd chains. In this paper we give a new and elementary proof that iff∈L(logL)^d?1([0, 1)) and(m _k ) _k=1 ^∞ is of dimensiond then $$\mathop {\lim }\limits_{N \to \infty } \frac{1}{N}\sum\limits_{n = 1}^N {f\left( {\left\{ {x + \frac{n}{{m_N }}} \right\}} \right)} = \int_X {fd\mu , a.e.,} $$ with respect to Lebesgue measure. This result was first proved byL. Dubins andJ. Pitman [2] using martingale theory.     

On almost good triples of vertices in edge regular graphs

Consider a connected edge regular graph Γ with parameters (v, k, λ) and put b ₁ = k?λ?1. A triple (u, w, z) of vertices is called (almost) good whenever d(u, w) = d(u, z) = 2 and µ(u, w)+µ(u, z) ≤ 2k ? 4b ₁ + 3 (and µ(u, w) + µ(u, z) = 2k ? 4b ₁ + 4). If k = 3b ₁ + γ with γ ≥ ?2, a triple (u, w, z) is almost good, and Δ = [u] ∩ [w] ∩ [z] then: either |Δ| ≤ 2; or Δ is a 3-clique and Γ is a Clebsch graph; or Δ is a 3-clique, k = 16, b ₁ = 6, and v = 31; or Δ is a 4-clique and Γ is a Schläfli graph.     

THE EXTREME POINTS OF SEVERAL CLASSES OF ANALYTIC FUNCTIONS

1Intr0ducti0nLetAden0tethesetofallfunctionsanalyticinA={z:Izl<1}.LetB={W:WEAandIW(z)l51}.Aisalocallyconvexlineaztop0l0gicalspacewithrespecttothetopologyofuniformconvergenceon`c0mpact8ubsetsofA-LetTh(c1,'tc.-1)={p(z):p(z)EA,Rop(z)>0,p(z)=1 clz czzz ' c.-lz"-l 4z" ',wherecl,',cn-1areforedcomplexconstants}.LetTh,.(b,,-..,b,-,)={p(z):P(z)'EAwithReP(z)>Oandp(z)=1 blz ' b.-lz"-l 4z" '-,wherebl,-'-jbu-1areffeedrealconstantsanddkarerealnumbersf0rk=n,n 1,'--}-LetTu(l1,'i'tI.-1)={…     

Bounding the number of connected components of a real algebraic set

For every polynomial mapf=(f ₁,…,f _k): ℝ ⁿ →ℝ ^k , we consider the number of connected components of its zero set,B(Z _f) and two natural “measures of the complexity off,” that is the triple(n, k, d), d being equal to max(degree off _i), and thek-tuple (Δ₁,...,Δ₄), Δ _k being the Newton polyhedron off _i respectively. Our aim is to boundB(Z _f) by recursive functions of these measures of complexity. In particular, with respect to (n, k, d) we shall improve the well-known Milnor-Thom’s bound μ _d (n)=d(2d−1) ⁿ⁻¹. Considered as a polynomial ind, μ _d (n) has leading coefficient equal to 2 ⁿ⁻¹. We obtain a bound depending onn, d, andk such that ifn is sufficiently larger thank, then it improves μ _d (n) for everyd. In particular, it is asymptotically equal to 1/2(k+1)n ^k−1 dⁿ, ifk is fixed andn tends to infinity. The two bounds are obtained by a similar technique involving a slight modification of Milnor-Thom's argument, Smith's theory, and information about the sum of Betti numbers of complex complete intersections.     

Characterizations of the Poisson process as a renewal process via two conditional moments

Given two independent positive random variables, under some minor conditions, it is known that fromE(X^rX+Y)=a(X+Y)^r andE(X^sX+Y)=b(X+Y)^s, for certain pairs ofr ands, wherea andb are two constants, we can characterizeX andY to have gamma distributions. Inspired by this, in this article we will characterize the Poisson process among the class of renewal processes via two conditional moments. More precisely, let {A(t), t0} be a renewal process, with {S _k, k1} the sequence of arrival times, andF the common distribution function of the inter-arrival times. We prove that for some fixedn andk, kn, ifE(S _k ^r A(t)=n)=at^r andE(S _k ^s A(t)=n)=bt^s, for certain pairs ofr ands, wherea andb are independent oft, then {A(t), t0} has to be a Poisson process. We also give some corresponding results about characterizingFto be geometric whenF is discrete.Support for this research was provided in part by the National Science Council of the Republic of China, Grant No. NSC 81-0208-M110-06.     

Finite time extinction of super-Brownian motions with deterministic catalyst

In this paper we consider a super-Brownian motion X with branching mechanism k(x)zα, where k(x) > 0 is a bounded Holder continuous function on Rd and infx∈Rd k(x) = 0. We prove that if k(x) ≥ //x// -l(0 ≤l < ∞) for sufficiently large x, then X has compact support property, and for dimension d = 1, if k(x) ≥exp(-l‖x‖)(0≤l < ∞) for sufficiently large x, then X also has compact support property. The maximal order of k(x) for finite time extinction is different between d = 1, d = 2 and d ≥ 3: it is O(‖x‖-(α+1)) in one dimension, O(‖x‖-2(log‖x‖)-(α+1) ) in two dimensions, and O(‖x‖2) in higher dimensions. These growth orders also turn out to be the maximum order for the nonexistence of a positive solution for 1/2Δu =k(x)uα.     

A dimension series for multivariate splines

For a polyhedral subdivision Δ of a region in Euclideand-space, we consider the vector spaceC _k ^r (Δ) consisting of allC ^r piecewise polynomial functions over Δ of degree at mostk. We consider the formal power series ∑ _k≥0 dim_? C _k ^r (Δ)λ^k and show, under mild conditions on Δ, that this always has the formP(λ)/(1?λ) ^d+1, whereP(λ) is a polynomial in λ with integral coefficients which satisfiesP(0)=1,P(1)=f _d (Δ), andP′(1)=(r+1)f _d?1 ⁰ (Δ). We discuss how the polynomialP(λ) and bases for the spacesC _k ^r (Δ) can be effectively calculated by use of Gröbner basis techniques of computational commutative algebra. A further application is given to the theory of hyperplane arrangements.     

Neuere Untersuchungen über die Jacobsthal-Funktiong(n)

The Jacobsthal functiong(n) is defined as the maximal distance between two integers relatively prime ton. Letk, l,... be natural numbers, letp ₁,p ₂,... be primes. From $$3 \leqq l \leqq p_1< ...< p_{l - 1}< k + 2 - l \leqq p_l< ...< p_k $$ followsTheorem 1. g(p ₁ ...p _k )≦g(p ₁ ...p _l?1 )g(p _l ...p _k )=l(k+2?l), ifkl is large enough.Theorem 1′. From (1) and12≦l followsg(p ₁ ...p _k )≦l(k+2?l).     

On degrees of maps between Grassmannians

Let G_n,k denote the oriented grassmann manifold of orientedk-planes in ℝⁿ. It is shown that for any continuous mapf: G_n,k → G_n,k, dim G_n,k = dim G_m,l = l(m −l), the Brouwer’s degree is zero, providedl > 1,n ≠ m. Similar results for continuous mapsg: ℂG_m,l → ℂG_n,k,h: ℍG_m,l → ℍG_n,k, 1 ≤ l < k ≤ n/2, k(n — k) = l(m — l) are also obtained.     

Existence and uniqueness of the solution,separation for certain second order elliptic differential equation

In this paper, we study conditions under which Schrodinger type operators with a matrix potential is separated and Schrodinger equation has a unique solution in the weighted space L_2,k(Rⁿ)^l, where l is any natural number and k ε C¹(Rⁿ) is a positive function     

Fractional weak discrepancy and split semiorders

The fractional weak discrepancywd_F(P) of a poset P=(V,?) was introduced in Shuchat et al. (2007) [6] as the minimum nonnegative k for which there exists a function f:V→R satisfying (i) if a?b then f(a)+1≤f(b) and (ii) if a∥b then |f(a)−f(b)|≤k. In this paper we generalize results in Shuchat et al. (2006, 2009) [5] and [7] on the range of wd_F for semiorders to the larger class of split semiorders. In particular, we prove that for such posets the range is the set of rationals that can be represented as r/s for which 0≤s−1≤r<2s.     

Properties of Regular Uniform k—Stratified Graphs

A regular graph G = (V, E) is a k-stratified graph if V is partitioned into V₁, V₂, …, V_k subsets called strata. The stratification splits the degree d_v ∀v ϵ V into k-integers d_v1, d_v2, …, d_vk each one corresponding to a stratum. If d_v1 = d_v2 = … = d_vk ∀v ϵ V then G is called regular uniform k-stratified, RU^k_s(n, d) where n is the cardinality of the vertex set in each stratum and d is the degree of every vertex in each stratum. For every k, the class RU^k_s(n, d) has a unique graph generator class RU^l_s(n, d) derived by decomposition of graphs in RU^k_s(n, d). We investigate the minimization of the cardinality of V, the colorability, vertex coloring and the diameter of the graphs in the class. We also deal with complexity questions concerning RU^k_s(n, d). Some well-known computer network models such as barrel shifters and hypercubes are shown to belong in RU^k_s(n, d).