Betti Numbers of Toric Varieties and Eulerian Polynomials

It is well known that the Eulerian polynomials, which count permutations in S _n by their number of descents, give the h-polynomial/h-vector of the simple polytopes known as permutohedra, the convex hull of the S _n -orbit for a generic weight in the weight lattice of S _n . Therefore, the Eulerian polynomials give the Betti numbers for certain smooth toric varieties associated with the permutohedra.

In this article we derive recurrences for the h-vectors of a family of polytopes generalizing this. The simple polytopes we consider arise as the orbit of a nongeneric weight, namely, a weight fixed by only the simple reflections J = {s _n , s _n?1, s _n?2,…, s _n?k+2, s _n?k+1} for some k with respect to the A _n root lattice. Furthermore, they give rise to certain rationally smooth toric varieties X(J) that come naturally from the theory of algebraic monoids. Using effectively the theory of reductive algebraic monoids and the combinatorics of simple polytopes, we obtain a recurrence formula for the Poincaré polynomial of X(J) in terms of the Eulerian polynomials.     

On the Range of Possible Integrities of Graphs G(n, k)

We discuss the range of values for the integrity of a graphs G(n, k) where G(n, k) denotes a simple graph with n vertices and k edges. Let I _max(n, k) and I _min(n, k) be the maximal and minimal value for the integrity of all possible G(n, k) graphs and let the difference be D(n, k) = I _max(n, k) − I _min(n, k). In this paper we give some exact values and several lower bounds of D(n, k) for various values of n and k. For some special values of n and for s < n ^1/4 we construct examples of graphs G _n  = G _n (n, n + s) with a maximal integrity of I(G _n ) = I(C _n ) + s where C _n is the cycle with n vertices. We show that for k = n ²/6 the value of D(n, n ²/6) is at least \frac?6-13n{\frac{\sqrt{6}-1}{3}n} for large n.     

A self-normalized Erd s—Rényi type strong law of large numbers

The original Erd s—Rényi theorem states that max_0kn∑^k+[clogn]_i=k+1X_i/[clogn]→α(c),c>0, almost surely for i.i.d. random variables {X_n, n1} with mean zero and finite moment generating function in a neighbourhood of zero. The latter condition is also necessary for the Erd s—Rényi theorem, and the function α(c) uniquely determines the distribution function of X₁. We prove that if the normalizing constant [c log n] is replaced by the random variable ∑^k+[clogn]_i=k+1(X²_i+1), then a corresponding result remains true under assuming only the exist first moment, or that the underlying distribution is symmetric.     

A note on the probabilistic approach to Turán's problem

The Turán number T(n, l, k) is the smallest possible number of edges in a k-graph on n vertices such that every l-set of vertices contains an edge. Given a k-graph H = (V(H), E(H)), we let X_s(S) equal the number of edges contained in S, for any s-set S?V(H). Turán's problem is equivalent to estimating the expectation E(X_l), given that min(X_l) ≥ 1. The following lower bound on the variance of X_s is proved:

$\text{Var(X}{}_{\mathrm{s}}\text{)?mm}\text{n?2k}\text{s?k}\text{n}\text{s}{}^{\mathrm{?1}}\text{n}\text{k}{}^1$

, where m = |E(H)| and $\text{m}\text{= (}{}_{\mathrm{k}}{}^{\mathrm{n}}\text{) ? m}$. This implies the following: putting t(k, l) = lim_n→∞T(n, l, k)(_kⁿ)^?1 then t(k, l) ≥ T(s, l, k)((_k^s) ? 1)^?1, whenever s ≥ l > k ≥ 2. A connection of these results with the existence of certain t-designs is mentioned.     

On the fluctuations of independent copies of moving maxima

Let {X_n, n1} be a sequence of independent random variables (r.v.'s) with a common distribution function (d.f.) F. Define the moving maxima Y_k(n)=max(X_n−k(n)+1,X_n−k(n)+2,…,X_n), where {k(n), n1} is a sequence of positive integers. Let Y_k(n)¹ and Y_k(n)² be two independent copies of Y_k(n). Under certain conditions on F and k(n), the set of almost sure limit points of the vector consisting of properly normalised Y_k(n)¹ and Y_k(n)² is obtained.     

Some characterization results based on the conditional expectation of a function of non-adjacent order statistic (record value)

In this paper, we attempt to characterize a distribution by means ofE[ψ(X _k +s:n)|X _k:n =z]g(z), under some mild conditions on ψ(·) andg(·). An explicit result is provided in the case ofs=1 and a uniqueness result is proved in the case ofs=2. For the general case, an expression is provided for the conditional expectation. Similar results are proved for the record values, both in the continuous as well as in the discrete case (weak records).     

Nonhomogeneous recursions and Generalised Continued Fractions

Consider the (n+1)st order nonhomogeneous recursionX _k+n+1=b _k X _k+n +a _k ⁽ⁿ⁾ X _k+n-1+...+a _k ⁽¹⁾ X _k +X _k .Leth be a particular solution, andf ⁽¹⁾,...,f ⁽ⁿ⁾,g independent solutions of the associated homogeneous equation. It is supposed thatg dominatesf ⁽¹⁾,...,f ⁽ⁿ⁾ andh. If we want to calculate a solutiony which is dominated byg, but dominatesf ⁽¹⁾,...,f ⁽ⁿ⁾, then forward and backward recursion are numerically unstable. A stable algorithm is derived if we use results constituting a link between Generalised Continued Fractions and Recursion Relations.     

Idempotent Generation in the Endomorphism Monoid of a Uniform Partition

Denote by 𝒯_n and 𝒮_n the full transformation semigroup and the symmetric group on the set {1,…, n}, and ?_n = {1} ∪ (𝒯_n?𝒮_n). Let 𝒯(X, 𝒫) denote the monoid of all transformations of the finite set X preserving a uniform partition 𝒫 of X into m subsets of size n, where m, n ≥ 2. We enumerate the idempotents of 𝒯(X, 𝒫), and describe the submonoid S = ? E ? generated by the idempotents E = E(𝒯(X, 𝒫)). We show that S = S₁ ∪ S₂, where S₁ is a direct product of m copies of ?_n, and S₂ is a wreath product of 𝒯_n with 𝒯_m?𝒮_m. We calculate the rank and idempotent rank of S, showing that these are equal, and we also classify and enumerate all the idempotent generating sets of minimal size. In doing so, we also obtain new results about arbitrary idempotent generating sets of ?_n.     

Theorems of large deviations in the multivariate invariance principle

Let B be a real separable Banach space with norm |ß|_B, X, X₁, X₂, … be a sequence of centered independent identically distributed random variables taking values in B. Let s_n = s_n(t), 0 ≤ t ≤ 1 be the random broken line such that s_n(0) = 0, s_n(k/n) = n^−1/2 Σ_i=1^k X_i for n = 1, 2, … and k = 1, …, n. Denote |s_n|_B = sup_{0 ≤ t ≤ 1} |s_n(t)|_B and assume that w(t), 0 ≤ t ≤ 1 is the Wiener process such that covariances of w(1) and X are equal. We show that under appropriate conditions P(|s_n|_B > r) = P(|w|_B > r)(1 + o(1)) and give estimates of the remainder term. The results are new already in the case of B having finite dimension.     

Spectral Criteria of Abstract Sequences; Application to Difference Equations

We suppose that M is a closed subspace of l ^∞(J, X), the space of all bounded sequences {x(n)} _n?J ? X, where J ? {Z⁺,Z} and X is a complex Banach space. We define the M-spectrum σ_M (u) of a sequence u ? l ^∞(J,X). Certain conditions will be supposed on both M and σ_M (u) to insure the existence of u ? M. We prove that if u is ergodic, such that σ_M (u,) is at most countable and, for every λ ? σ_M (u), the sequence e^?iλnu(n) is ergodic, then u ? M. We apply this result to the operator difference equationu(n + 1) = Au(n) + ψ(n), n ? J,and to the infinite order difference equation Σ ^r _k=1 a_k (u(n + k) ? u(n)) + Σ _{s ? Z}?(n ? s)u(s) = h(n), n?J, where ψ?l ^∞(Z,X) such that ψ| _J ? M, A is the generator of a C ₀-semigroup of linear bounded operators {T(t)} _t>0 on X, h ? M, ? ? l ¹(Z) and a_k ?C. Certain conditions will be imposed to guarantee the existence of solutions in the class M.     

Two-sided eigenvalue estimates for subordinate processes in domains

Let X={X_t,t?0} be a symmetric Markov process in a state space E and D an open set of E. Denote by X^D the subprocess of X killed upon leaving D. Let S={S_t,t?0} be a subordinator with Laplace exponent φ that is independent of X. The processes X^φ?{X_St,t?0} and are called the subordinate processes of X and X^D, respectively. Under some mild conditions, we show that, if {-μ_n,n?1} and {-λ_n,n?1} denote the eigenvalues of the generators of the subprocess of X^φ killed upon leaving D and of the process X^D respectively, then

     

Complexity of solution of linear systems in rings of differential operators

Suppose given a k₁×k₂ system of linear equations over the Weyl algebraA _n = F[X₁,...X₁,D₄,...,D_n] or over the algebra of differential operatorsK _n = F[X₁,...X₁,D₄,...,D_n], where the degree of each coefficient of the system is less than d. It is proved that if the system is solvable overA _n, orK _n, respectively, then it has a solution of degree at most (k, d)²⁰⁽ⁿ⁾.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 192, pp. 47–59, 1991.     

A general approach to optimal control of a regression experiment

Let $\text{θ}\text{θ}\text{?}$ = ($\text{θ}\text{θ}\text{?}$₁, $\text{θ}\text{θ}\text{?}$₂, …, $\text{θ}\text{θ}\text{?}$_n)′ be the least-squares estimator of θ = (θ₁, θ₂, …, θ_n)′ by the realization of the process y(t) = Σ_{k = 1}ⁿθ_kf_k(t) + ξ(t) on the interval T = [a, b] with f = (f₁, f₂, …, f_n)′ belonging to a certain set X. The process satisfies E(ξ(t))≡0 and has known continuous covariance r(s, t) = E(ξ(s)ξ(t)) on T × T. In this paper, A-, D-, and D_s-optimality are used as criteria for choosing f in X. A-, D-, and D_s-optimal models can be constructed explicitly by means of r.     

Non-regular simplicial matroids

Let (ks) denote the set of all k-element-subsets of a finite set S. A k-simplical matroid on a subset E of (ks) is a binary matroid the circuit of which are simplicial complexes {X1,…Xm} ? E with boundary 0 (mod 2). The k-simplical matroid on (ks) is called the full simplicial matroid Gk(S). The polygon matroid on the edges of a finite graph is 2-simplicial. Polygon-matroids and their duals are regular. The dual of Gk(S) is Gn?k(S) if the cardinnlity of S is n. More details on simplicial matroids can be found in [3, Chapter 6] and also in [4, pp. 180–181].Welsh asked if every simplicial matroid is regular. We prove that this is not the case, for all full k-simplicial matroids Gk(S) with 3?k?n?3 are non-regular (n is the cardinality of S). This result has also been proved σy R. Cordovil and M. Las Vergnas recently. Their proof is different from our proof, which is somewhat shorter.     

The second and the third smallest distances on the sphere

Let s₁ (n) denote the largest possible minimal distance amongn distinct points on the unit sphere . In general, let s_k(n) denote the supremum of thek-th minimal distance. In this paper we prove and disprove the following conjecture of A. Bezdek and K. Bezdek: s₂(n) = s₁([n/3]). This equality holds forn > n₀ however s₂(12) > s₁(4).We set up a conjecture for s_k(n), that one can always reduce the problem of thek-th minimum distance to the function s₁. We prove this conjecture in the casek=3 as well, obtaining that s₃(n) = s₁([n/5]) for sufficiently largen.The optimal construction for the largest second distance is obtained from a point set of size [n/3] with the largest possible minimal distance by replacing each point by three vertices of an equilateral triangle of the same size . If 0, then s₂ tends to s₁([n/3]). In the case of the third minimal distance, we start with a point set of size [n/5] and replace each point by a regular pentagon.     

Central limit theorems in D[0, 1]

Summary Let X be a stochastic process with sample paths in the usual Skorohod space D[0, 1]. For a sequence {X _n} of independent copies of X, let S _n=X₁++X_n. Conditions which are either necessary or sufficient for the weak convergence of n ^–1/2(S _n–ES_n) to a Gaussian process with sample paths in D[0, 1] are discussed. Stochastically continuous processe are considered separately from those with fixed discontinuities. A bridge between the two is made by a Decomposition central limit theorem.     

The <Emphasis Type="Italic">k</Emphasis>-point exponent set of primitive digraphs with girth 2

Let D = （V, E） be a primitive digraph. The vertex exponent of D at a vertex v∈ V, denoted by expD（v）, is the least integer p such that there is a v →u walk of length p for each u ∈ V. Following Brualdi and Liu, we order the vertices of D so that exPD（V1） ≤ exPD（V2） …≤ exPD（Vn）. Then exPD（Vk） is called the k- point exponent of D and is denoted by exPD （k）, 1≤ k ≤ n. In this paper we define e（n, k） ：= max{expD （k） ｜ D ∈ PD（n, 2）} and E（n, k） ：= {exPD（k）｜ D ∈ PD（n, 2）}, where PD（n, 2） is the set of all primitive digraphs of order n with girth 2. We completely determine e（n, k） and E（n, k） for all n, k with n ≥ 3 and 1 ≤ k ≤ n.     

Wellposedness of abstract Cauchy problems for second order differential equations

This paper concerns the abstract Cauchy problem (ACP) for an evolution equation of second order in time. LetA be a closed linear operator with domainD(A) dense in a Banach spaceX. We first characterize the exponential wellposedness of ACP onD(A ^k+1),k teN. Next let {C(t);t teR} be a family of generalized solution operators, on [D(A ^k)] toX, associated with an exponentially wellposed ACP onD(A ^k+1). Then we define a new family {T(t); Ret>0} by the abstract Weierstrass formula. We show that {T(t)} forms a holomorphic semigroup of class (H _k) onX. Research of the second-named author was partially supported by Grant-in-Aid for Scientific Research (No. 63540139), Ministry of Education, Science and Culture.     

THE STRUCTURE OF THE TANGENT CONE: AN INTERESTING BIJECTION#

ABSTRACT

Let X = Spec(R) be a reduced equidimensional algebraic variety over an algebraically closed field k. Let Y = Spec(R/𝔮) be a codimension one ordinary multiple subvariety, where 𝔮 is a prime ideal of height 1 of R. If U is a nonempty open subset of Y and 𝔪 a closed point of U, we denote by A ? R _𝔪 its local ring in X, by 𝔭 the extension of 𝔮 in A, and by K the algebraic closure of the residue field k(𝔭).

Then there exists a bijection γ^𝔪:Proj(G _𝔭(A) ?  _A/𝔭 k) → Proj(G(A _𝔭) ?  _k(𝔭)K) such that for every subset Σ of Proj(G _𝔭(A) ?  _A/𝔭 k), the Hilbert function of Σ coincides with the Hilbert function of γ^𝔪(Σ). We examine some applications. We study the structure of the tangent cone at a closed point of a codimension one ordinary multiple subvariety.