Designs associated with maximum independent sets of a graph

A (v, β _o , μ)-design over regular graph G = (V, E) of degree d is an ordered pair D = (V, B), where |V| = v and B is the set of maximum independent sets of G called blocks such that if i, j ∈ V, i ≠ j and if i and j are not adjacent in G then there are exactly μ blocks containing i and j. In this paper, we study (v, β _o , μ)-designs over the graphs K _n × K _n , T(n)-triangular graphs, L ₂(n)-square lattice graphs, Petersen graph, Shrikhande graph, Clebsch graph and the Schläfli graph and non-existence of (v, β _o , μ)-designs over the three Chang graphs T ₁(8), T ₂(8) and T ₃(8).     

Traces of Quantized Canonical Transformations Localized on a Finite Set of Points

For an embedding i : X ? M of smooth manifolds and a Fourier integral operator Φ on M defined as the quantization of a canonical transformation g: T*M \ {0} → T*M \ {0}, we consider the operator i*Φi* on the submanifold X, where i* and i_* are the boundary and coboundary operators corresponding to the embedding i. We present conditions on the transformation g under which such an operator has the form of a Fourier integral operator associated with the fiber of the cotangent bundle over a point. We obtain an explicit formula for calculating the amplitude of this operator in local coordinates.     

Field theory and anisotropy of a cubic ferromagnet near the Curie point

It is known that critical fluctuations can change the effective anisotropy of a cubic ferromagnet near the Curie point. If the crystal undergoes a phase transition into the orthorhombic phase and the initial anisotropy is not too strong, then the effective anisotropy acquires the universal value A* = v*/u* at T _c, where u* and v* are the coordinates of the cubic fixed point of the renormalization group equations in the scaling equation of state and expressions for nonlinear susceptibilities. Using the pseudo-?-expansion method, we find the numerical value of the anisotropy parameter A at the critical point. Padé resummation of the six-loop pseudo-?-expansions for u*, v*, and A* leads to the estimate A* = 0.13 ± 0.01, giving evidence that observation of anisotropic critical behavior of cubic ferromagnets in physical and computer experiments is entirely possible.     

Bivariate Binomial Moments and Bonferroni-Type Inequalities

We obtain bivariate forms of Gumbel’s, Fréchet’s and Chung’s linear inequalities for P(S ≥ u, T ≥ v) in terms of the bivariate binomial moments {S _{i, j} }, 1 ≤ i ≤ k,1 ≤ j ≤ l of the joint distribution of (S, T). At u = v = 1, the Gumbel and Fréchet bounds improve monotonically with non-decreasing (k, l). The method of proof uses combinatorial identities, and reveals a multiplicative structure before taking expectation over sample points.     

Block partitions of sequences

Given a sequence A = (a ₁, …, a _n ) of real numbers, a block B of A is either a set B = {a _i , a _i+1, …, a _j } where i ≤ j or the empty set. The size b of a block B is the sum of its elements. We show that when each a _i ∈ [0, 1] and k is a positive integer, there is a partition of A into k blocks B ₁, …, B _k with |b _i ?b _j | ≤ 1 for every i, j. We extend this result in several directions.     

The optimal solution set of the interval linear programming problems

Several methods exist for solving the interval linear programming (ILP) problem. In most of these methods, we can only obtain the optimal value of the objective function of the ILP problem. In this paper we determine the optimal solution set of the ILP as the intersection of some regions, by the best and the worst case (BWC) methods, when the feasible solution components of the best problem are positive. First, we convert the ILP problem to the convex combination problem by coefficients 0 ≤ λ _j , μ _ij , μ _i  ≤ 1, for i = 1, 2, . . . , m and j = 1, 2, . . . , n. If for each i, j, μ _ij  = μ _i  = λ _j  = 0, then the best problem has been obtained (in case of minimization problem). We move from the best problem towards the worst problem by tiny variations of λ _j , μ _ij and μ _i from 0 to 1. Then we solve each of the obtained problems. All of the optimal solutions form a region that we call the optimal solution set of the ILP. Our aim is to determine this optimal solution set by the best and the worst problem constraints. We show that some theorems to validity of this optimal solution set.     

Comparisons of Left Recollements

Let (F′, F, F″) be a comparison of left recollements of triangulated categories such that F′ and F″ are equivalences. We prove that if F is full then F is an equivalence; and on the other hand, we construct a class of examples via the derived categories of Morita rings, showing that there really exists such a comparison (F′, F, F″) so that F is not an equivalence. This is in contrast to the case of a recollement. We also give a class of examples of left recollements of homotopy categories, which can not sit in recollements.     

On the homotopy category of AC-injective complexes

Let R be any ring. We motivate the study of a class of chain complexes of injective R-modules that we call AC-injective complexes, showing that K(AC-Inj), the chain homotopy category of all AC-injective complexes, is always a compactly generated triangulated category. In general, all DGinjective complexes are AC-injective and in fact there is a recollement linking K(AC-Inj) to the usual derived category D(R). This is based on the author’s recent work inspired by work of Krause and Stovicek. Our focus here is on giving straightforward proofs that our categories are compactly generated.     

Transversals in Superdisjoint <Emphasis Type="Italic">T</Emphasis>(3)-families of Translates

Let K denote an oval, a centrally symmetric compact convex domain with non-empty interior. A family of translates of K is said to have property T(k) if for every subset of at most k translates there exists a common line transversal intersecting all of them. Property T means that a transversal exists for all members of the family. Two translates, K _i and K _j are said to be φ-disjoint, φ>0, if the concentric φ-enlarged copies of K _i and K _j are disjoint. It is well known that in a φ-disjoint family of congruent discs T(3)?T if \(\varphi>\sqrt{2}\), and \(T(3)\not\Rightarrow T\) if \(\varphi<\sqrt{2}\). In this note finite φ-disjoint T(3)-families of translates of an oval will be investigated.     

A Probabilistic Characterization of the Dominance Order on Partitions

We present a probabilistic characterization of the dominance order on partitions. Let ν be a partition and Y _ν its Ferrers diagram, i.e. a stack of rows of cells with row i containing ν _i cells. Let the cells of Y _ν be filled with independent and identically distributed draws from the random variable X = B i n(r, p) with r ≥ 1 and p ∈ (0, 1). Given j, t ≥ 0, let P(ν, j, t) be the probability that the sum of all the entries in Y _ν is j while the sum of the entries in each row of Y _ν is no more than t. It is shown that if ν and μ are two partitions of n, ν dominates μ if and only if P(ν, j, t) ≤ P(μ, j, t) for all j, t ≥ 0. It is shown that the same result holds if X is any log-concave integer valued random variable with {i : P(X = i) > 0} = {0, 1,…,r} for some r ≥ 1.     

Asymptotic behavior of the spectrum of one-dimensional vibrations in a layered medium consisting of elastic and Kelvin–Voigt viscoelastic materials

For every algebraically closed field k of characteristic different from 2, we prove the following: (1) Finite-dimensional (not necessarily associative) k-algebras of general type of a fixed dimension, considered up to isomorphism, are parametrized by the values of a tuple of algebraically independent (over k) rational functions of the structure constants. (2) There exists an “algebraic normal form” to which the set of structure constants of every such algebra can be uniquely transformed by means of passing to its new basis—namely, there are two finite systems of nonconstant polynomials on the space of structure constants, {f_i}i∈I and {b_j}j∈J, such that the ideal generated by the set {f_i}i∈I is prime and, for every tuple c of structure constants satisfying the property b_j(c) ≠ 0 for all j ∈ J, there exists a unique new basis of this algebra in which the tuple c′ of its structure constants satisfies the property f_i(c′) = 0 for all i ∈ I.     

An improvement of the five halves theorem of J. Boardman

Let (M ^m , T) be a smooth involution on a closed smooth m-dimensional manifold and F = ∪ _j=0 ⁿ F ^j (n ≤ m) its fixed point set, where F ^j denotes the union of those components of F having dimension j. The famous Five Halves Theorem of J. Boardman, announced in 1967, establishes that, if F is nonbounding, then m ≤ 5/2n. In this paper we obtain an improvement of the Five Halves Theorem when the top dimensional component of F, F ⁿ , is nonbounding. Specifically, let ω = (i ₁, i ₂, …, i _r ) be a non-dyadic partition of n and s _ω (x ₁, x ₂, …, x _n ) the smallest symmetric polynomial over Z ₂ on degree one variables x ₁, x ₂, …, x _n containing the monomial \(x_1^{i_1 } x_2^{i_2 } \cdots x_r^{i_r }\). Write s _ω (F ⁿ ) ∈ H ⁿ (F ⁿ , Z ₂) for the usual cohomology class corresponding to s _ω (x ₁, x ₂, …, x _n ), and denote by ?(F ⁿ ) the minimum length of a nondyadic partition ω with s _ω (F ⁿ ) ≠ 0 (here, the length of ω = (i ₁, i ₂, …, i _r ) is r). We will prove that, if (M ^m , T) is an involution for which the top dimensional component of the fixed point set, F ⁿ , is nonbounding, then m ≤ 2n + ?(F ⁿ ); roughly speaking, the bound for m depends on the degree of decomposability of the top dimensional component of the fixed point set. Further, we will give examples to show that this bound is best possible.     

Asymptotic law of distribution of primes of special form

Let N₀ be the set of natural numbers whose binary expansions have an even number of 1’s, and let N₁ = N\N₀. In this paper, we obtain asymptotic formulas for the number of primes p not exceeding X and such that p ∈ N_i, p + 1 ∈ N_j, where i and j take values 0 and 1 independently of each other.     

Degeneracy of holomorphic curves in surfaces

LetX be a complex projective algebraic manifold of dimension 2 and let D₁, ..., D_u be distinct irreducible divisors onX such that no three of them share a common point. Let\(f:{\mathbb{C}} \to X\backslash ( \cup _{1 \leqslant i \leqslant u} D_i )\) be a holomorphic map. Assume thatu ? 4 and that there exist positive integers n₁, ... ,n_u,c such that n_in_J D _i.D_j) =c for all pairsi,j. Thenf is algebraically degenerate, i.e. its image is contained in an algebraic curve onX.     

New algorithm for computing the Hermite interpolation polynomial

Let x ₀, x ₁,? , x _n , be a set of n + 1 distinct real numbers (i.e., x _i ≠ x _j , for i ≠ j) and y _{i, k} , for i = 0,1,? , n, and k = 0 ,1 ,? , n _i , with n _i ≥ 1, be given of real numbers, we know that there exists a unique polynomial p _{N ? 1}(x) of degree N ? 1 where \(N={\sum }_{i=0}^{n}(n_{i}+1)\), such that \(p_{N-1}^{(k)}(x_{i})=y_{i,k}\), for i = 0,1,? , n and k = 0,1,? , n _i . P _N?1(x) is the Hermite interpolation polynomial for the set {(x _i , y _{i, k} ), i = 0,1,? , n, k = 0,1,? , n _i }. The polynomial p _N?1(x) can be computed by using the Lagrange polynomials. This paper presents a new method for computing Hermite interpolation polynomials, for a particular case n _i = 1. We will reformulate the Hermite interpolation polynomial problem and give a new algorithm for giving the solution of this problem, the Matrix Recursive Polynomial Interpolation Algorithm (MRPIA). Some properties of this algorithm will be studied and some examples will also be given.     

On Excess-time Correlated Cumulative Processes

In this paper a class of correlated cumulative processes, B _s (t) = ∑^N(t)_i=1 H _s (X _i )X _i , is studied with excess level increments X _i ?s, where {N(t), t ?0} is the counting process generated by the renewal sequence T _n , T _n and X _n are correlated for given n, H _s (t) is the Heaviside function and s?0 is a given constant. Several useful results, for the distributions of B _s (t), and that of the number of excess (non-excess) increments on (0, t) and the corresponding means, are derived. First passage time problems are also discussed and various asymptotic properties of the processes are obtained. Transform results, by applying a flexible form for the joint distribution of correlated pairs (T _n , X _n ) are derived and inverted. The case of non-excess level increments, X _i < s, is also considered. Finally, applications to known stochastic shock and pro-rata warranty models are given.     

On infinite-rank singular perturbations of the Schrödinger operator

Schrödinger operators with infinite-rank singular potentials V=Σ _i,j=1 ^∞ b _ij〈φ_j,·〉φ_i are studied under the condition that the singular elements ψ _j are ξ _j(t)-invariant with respect to scaling transformationsin ?³.     

On the Wick theorem for mixtures of centered Gaussian distributions

We consider centered conditionally Gaussian d-dimensional vectors X with random covariance matrix Ξ having an arbitrary probability distribution law on the set of nonnegative definite symmetric d × d matrices M _d ⁺. The paper deals with the evaluation problem of mean values \( E\left[ {\prod\nolimits_{i = 1}^{2n} {\left( {{c_i},X} \right)} } \right] \) for c _i ∈ ? ^d , i = 1, …, 2n, extending the Wick theorem for a wide class of non-Gaussian distributions. We discuss in more detail the cases where the probability law ?(Ξ) is infinitely divisible, the Wishart distribution, or the inverse Wishart distribution. An example with Ξ \( = \sum\nolimits_{j = 1}^m {{Z_j}{\sum_j}} \), where random variables Z _j , j = 1, …, m, are nonnegative, and Σ _j ∈ M _d ⁺, j = 1, …, m, are fixed, includes recent results from Vignat and Bhatnagar, 2008.     

Functional estimation of activity criticality indices and sensitivity analysis of expected project completion time

For a PERT network, a new method is developed for estimating the criticality index of activity i (ACI _i ) as a function of the expected duration of activity i (μ _i ) and for the sensitivity analysis of the expected project completion time (μ _T ) with respect to μ _i . The proposed method evaluates the frequency of activity i being on the critical path, and thereby its ACI _i using Monte Carlo simulation or a Taguchi orthogonal array experiment at several values of μ _i , fits a logistic regression model for estimating ACI _i as a function of μ _i , and then, using the estimated ACI _i function, evaluates the amount of change in μ _T when μ _i is changed by a given amount. Unlike the previous works, the proposed method models ACI _i as a nonlinear (ie, logistic) function of μ _i , which can be used to estimate the amount of change in μ _T for a variety of changes in μ _i . Computational results indicate that the performance of the proposed method is comparable to that of direct Monte Carlo simulation.     

Hausdorff dimension of the maximal run-length in dyadic expansion

For any x ∈ [0, 1), let x = [? ₁, ? ₂, …,] be its dyadic expansion. Call r _n (x):= max{j ? 1: ? _i+1 = … = ? _i+j = 1, 0 ? i ? n ? j} the n-th maximal run-length function of x. P.Erdös and A.Rényi showed that \(\mathop {\lim }\limits_{n \to \infty } \) r _n (x)/log₂ n = 1 almost surely. This paper is concentrated on the points violating the above law. The size of sets of points, whose runlength function assumes on other possible asymptotic behaviors than log₂ n, is quantified by their Hausdorff dimension.