On the minimal positive homothetic image of a simplex containing a convex body

Let C be a convex body, and let S be a nondegenerate simplex in ? ⁿ . It is proved that the minimal coefficientσ > 0 for which the translate of σS contains C is $$\sum\limits_{j = 1}^{n + 1} {\mathop {\max \left( { - \lambda _j \left( x \right)} \right) + 1,}\limits_{x \in C} }$$ where λ ₁(x), ..., λ _n +1(x) are the barycentric coordinates of the point x ∈ ? ⁿ with respect to S. In the case C = [0, 1] ⁿ , this quantity is reduced to the form Σ _i=1 ⁿ 1/d _i (S), where d _i (S) is the ith axial diameter of S, i.e., the maximal length of the segment from S parallel to the ith coordinate axis.     

Properties of Axial Diameters of a Simplex

Let S be a nondegenerate simplex in ? ⁿ . It is proved that the minimal possible σ>0, such that a homothetic copy of S of ratio σ contains [0,1] ⁿ , is equal to \(\sum_{i=1}^{n} 1/d_{i}(S)\). Here d _i (S) denotes the length of a longest segment in S parallel to the ith coordinate axis.     

The asymptotic ruin problem when the healthy and sick periods form an alternating renewal process

Let {T₁, Y₁}^∞_i=1 be a sequence of positive independent random variables. Let, also, Z₁ = βY′₁ ? πT_i, i = 1, 2, …, where Y′₁ = Max(0, Y_i ? w), w ? 0, and where β < 0 and π is such that E(Z₁) < 0. We consider the random walk of partial sums S_n = ?ⁿ_i=1Z_i in the presence of an absorbing region (u, ∞), u ? 0, and S₀ ≡ 0. Of interest is $\text{ψ(u) = Pr(}\text{S}\text{?}\text{≤ u)}$ where S? = Sup(0, S₁, S₂, …, S_n, …).     

A conjecture of recski in combinatorial set theory

A p-cover of $\text{n = {1, 2,…,}\text{n}\text{}}$ is a family of subsets $\text{S}{}_{\mathrm{i}}\text{≠ ?}$ such that ∪ S_i = n and |S_i ∩ S_i| ? p for i ≠ j. We prove that for fixed p, the number of p-cover of n is O(n^p+1logn).     

Subsets of a finite set that intersect each other in at most one element

In this paper we study de Bruijn-Erdös type theorems that deal with the foundations of finite geometries. The following theorem is one of our main conclusions. Let S₁,…, S_n be n subsets of an n-set S. Suppose that |S_i| ? 3 (i = 1,…,n) and that |S_i ∩ S_j| ? 1 (i ≠ j;i,j = 1,…,n). Suppose further that each S_i has nonempty intersection with at least n ? 2 of the other subsets. Then the subsets S₁,…,S_n of S are one of the following configurations. (1) They are a finite projective plane. (2) They are a symmetric group divisible design and each subset has nonempty intersection with exactly n ? 2 of the other subsets. (3) We have n = 9 or n = 10 and in each case there exists a unique configuration that does not satisfy (1) or (2).     

Isomorphism of circulant graphs and digraphs

Let S? {1, …, n?1} satisfy ?S = S mod n. The circulant graph G(n, S) with vertex set {v₀, v₁,…, v_n?1} and edge set E satisfies v_iv_j?E if and only if j ? i ∈ S, where all arithmetic is done mod n. The circulant digraph G(n, S) is defined similarly without the restriction S = ? S. Ádám conjectured that $\text{G(n, S) ? G(n, S′)}$ if and only if S = uS′ for some unit u mod n. In this paper we prove the conjecture true if n = pq where p and q are distinct primes. We also show that it is not generally true when n = p², and determine exact conditions on S that it be true in this case. We then show as a simple consequence that the conjecture is false in most cases when n is divisible by p² where p is an odd prime, or n is divisible by 2⁴.     

Erd?s-Zaks all divisor sets

Let ? _n be the finite cyclic group of order n and S ? ? _n . We examine the factorization properties of the Block Monoid B(? _n , S) when S is constructed using a method inspired by a 1990 paper of Erd?s and Zaks. For such a set S, we develop an algorithm in Section 2 to produce and order a set {M _i } _i=1 ^n?1 which contains all the non-primary irreducible Blocks (or atoms) of B(? _n , S). This construction yields a weakly half-factorial Block Monoid (see [9]). After developing some basic properties of the set {M _i } _i=1 ^n?1 , we examine in Section 3 the connection between these irreducible blocks and the Erd?s-Zaks notion of ??splittable sets.?? In particular, the Erd?s-Zaks notion of ??irreducible?? does not match the classic notion of ??irreducible?? for the commutative cancellative monoids B(? _n , S). We close in Sections 4 and 5 with a detailed discussion of the special properties of the blocks M1 with an emphasis on the case where the exponents of M ₁ take on extreme values. The work of Section 5 allows us to offer alternate arguments for two of the main results of the original paper by Erd?s and Zaks.     

On separable Lindenstrauss spaces

Isometric embeddings from l_∞ⁿin l_∞^{n + 1} can be described by a_i,n, i ? n, with $\text{∑}{}_{\mathrm{i\; =\; 1}}{}^{\mathrm{n}}\text{¦ a}{}_{\mathrm{i,n}}\text{¦ ? 1}$, such that e_i,n = e_{i,n + 1} + a_i,ne_{n + 1,n + 1}; i = 1,…, n; holds, where e_i,nand e_{i,n + 1} are the elements of the canonical unit vector bases of l_∞ⁿand l_∞^{n + 1}, respectively (negative signs may occur). We study the connections between a triangular substochastic matrix A, whose nth column consists of the elements a_i,n, i = 1,…, n, and the Banach space a_i,n, E_n ? E_{n + 1}, E_n ? l_∞ⁿ, where A determines the embeddings of the E_n. The class of these Banach spaces is the class of all separable Lindenstrauss spaces. Sufficient and necessary conditions are stated for a matrix A to represent c₀and c. Furthermore, we characterize the class of all extreme triangular substochastic matrices which represents C(K), where K is the Cantor set. We investigate how the special biface structure of the dual unit ball of X is reflected in the elements of a matrix A representing the separable Lindenstrauss space X. This is applicable to Gurarij spaces; we give a new proof for the maximality property of Gurarij spaces and show that they are isomorphic to A(S) where S is a Choquet simplex with dense extreme points.     

Subsequence numbers and logarithmic concavity

Let S be a finite sequence of length r whose terms come from the finite alphabet a. The subsequence number of S (i = 0…r) is the number of distinct t-long subsequences of S. We prove (1) for r and a fixed, the S simultaneously attain their maximum possible values if and only if S is a repeated permutation of a (meaning no letters appears twice in S without all of the other letters of a intervening): (2) the numbers S…S……S, are logarithmically concave: and (3) over any central interval S…S……S…(iSr ? i). S, is least (through perhaps not uniquely). In addition, we show that for the generalized binomial coefficients c(i.j.n) defined by (1+x+…+ x^m?1)¹ = Σc(i.j.n)x¹, the sequence c(i ? 1.1.n), c(i?2.2n)… is strongly logarithmically concave, thus extending a result of S.M. Tanny and M. Zuker. Logarithmic concavity is treated in the context of triangular arrays of numbers.     

A symmetry relationship for a class of partitions

Let S(n, k, v) denote the number of vectors (a₀,…, a_n?1) with nonnegative integer components that satisfy a₀ + … + a_{n ? 1} = k and Σ_i=0^n?1ia_i ≡ v (mod n). Two proofs are given for the relation S(n, k, v) = S(k, n, v). The first proof is by algebraic enumeration while the second is by combinatorial construction.     

Zur Eulerschen Charakteristik allgemeiner,insbesondere konvexer Polyeder

We establish the existence of Eulers characteristic χ for general polyhedra P ?R ⁿ and prove, that for a convex polyhedron it takes the value \(\Sigma^{n}_{i=0}(-1)^{i}s_{i}\) , where s _i is the number of those i-dimensional faces of P, for which S ? P. The main reason for this representation is the non-trivial fact, that if S ? P for some face S of a convex polyhedron P, then S is convex. Furthermore we extend the Euler-Schläfli theorem to include all closed and convex (but not necessarily bounded) polyhedra.     

Presentations of alternating semigroups

One presentation of the alternating groupA _n hasn?2 generatorss ₁,…,s_n?2 and relationss ₁ ³ =s _i ² =(s_1?1s_i)³=(s_js_k)²=1, wherei>1 and |j?k|>1. Against this backdrop, a presentation of the alternating semigroupA _n ^c )A _n is introduced: It hasn?1 generatorss ₁,…,S _n?2,e, theA _n-relations (above), and relationse ²=e, (es ₁)⁴, (es _j)²=(es _j)⁴,es _i=s _i s ₁ ^-1 es ₁, wherej>1 andi≥1.     

Reflection classes whose cubes cover the alternating group

A reflection class (REC) over a finite set A is a conjugacy class of a reflection (permutation of order ? 2) of A. It was known that for no REC X, X² = Alt(n) holds, and that for some RECs X, X⁴ = Alt(n) holds (n ? 5). Let i > 0, and let c(θ) denote the number of cycles of θ?S(n). Let X_i = {ψ ∈ S(n): ψ² = 1, ψ has exactly i fixed points}. We prove that θ?X_i³ if and only if: (1) i ≡ n (mod 2); (2) The parity of X_i equals the parity of θ; and (3) $\text{i ?}\text{1}\text{3}\text{(n + 2 c(θ))}$. As a consequence, {X: X is a REC, X³ = Alt(n)} and {X: X is a REC, X³ = S(n) ? Alt(n)} are determined.     

A characterization of planar cubic graphs

If S is a collection of circuits in a graph G, the circuits in S are said to be consistently orientable if G can be oriented so that they are all directed circuits. If S is a set of three or more consistently orientable circuits such that no edge of G belongs to more than two circuits of S, then S is called a ring if there exists a cyclic ordering C₀, C₁,…, C_{n ? 1}, C₀ of the n circuits in S such that $\text{EC}{}_{\mathrm{i}}\text{? EC}{}_{\mathrm{j}}\text{≠ ?}$ if and only if j = i or j ≡ i ? 1 (mod n) or j ≡ i + 1 (mod n). We characterise planar cubic graphs in terms of the non-existence of a ring with certain specified properties.     

The method of asymptotic stabilization to a given trajectory based on a correction of the initial data

Let S be an operator in a Banach space H and S ⁱ (u) (i = 0, 1, ..., u ∈ H) be the evolutionary process specified by S. The following problem is considered: for a given point z ₀ and a given initial condition a ₀, find a correction l such that the trajectory {S ⁱ (a ₀ + l)} approaches }S ⁱ (z ₀)} for 0 < i ≤ n. This problem is reduced to projecting a ₀ on the manifold ?^?(z ₀, f ⁽ⁿ⁾) defined in a neighborhood of z ₀ and specified by a certain function f ⁽ⁿ⁾. In this paper, an iterative method is proposed for the construction of the desired correction u = a ₀ + l. The convergence of the method is substantiated, and its efficiency for the blow-up Chafee-Infante equation is verified. A constructive proof of the existence of a locally stable manifold ?^?(z ₀, f) in a neighborhood of a trajectory of hyperbolic type is one of the possible applications of the proposed method. For the points in ?^?(z ₀, f), the value of n can be chosen arbitrarily large.     

On maximal antichains consisting of sets and their complements

Let 1 ? k₁ ? k₂ ? … ? k_n be integers and let S denote the set of all vectors x = (x₁, x₂, …, x_n) with integral coordinates satisfying 0 ? x_i ? k_i, i = 1, 2, …, n. The complement of x is (k₁ ? x₁, k₂ ? x₂, …, k_n ? x_n) and a subset X of S is an antichain provided that for any two distinct elements x, y of X, the inequalities x_i ? y_i, i = 1, 2, …, n, do not all hold. We determine an LYM inequality and the maximal cardinality of an antichain consisting of vectors and its complements. Also a generalization of the Erdös-Ko-Rado theorem is given.     

Approximate extension of partial ε-characters of abelian groups to characters with application to integral point lattices

Let G be an abelian group, S ⊆ G be a finite set, and T denote the multiplicative group of complex unitswith the invariant arc metric | arg(a/b)|. We will show that for a mapping ? : S → T to be ε-close on S to a character φ : G → T it is enough that ? be extendable to a mapping ¯f : (S U {1} US⁻¹)ⁿ → T, where n is big enough and ¯f violates the homomorphy condition at most up to an arbitrary σ < min(ε, π/2). Moreover, n can be chosen uniformly, independently of G and both ? and ¯f, depending just on σ, ε and the number of elements of S. The proof is non-constructive, using the ultraproduct construction and Pontryagin duality, hence yielding no estimate on the actual size of n. As one of the applications we show that, for a vector u ∈ R ^q to be ε-close to some vector from the dual lattice H^★ of a full rank integral point lattice H ⊆ ?^q, it is enough for the scalar product ux to be δ-close (with δ < 1/3) to an integer for all vectors xH satisfying Σ_i|x_i | < n, where n depends on δ, ε and q only.     

A Fisher type inequality

In this paper we study subsets of a finite set that intersect each other in at most one element. Each subset intersects most of the other subsets in exactly one element. The following theorem is one of our main conclusions. Let S₁,… S_m be m subsets of an n-set S with |S₁| ? 2 (l = 1, …,m) and |S_i ∩ S_j| ? 1 (i ≠ j; i, j = 1, …, m). Suppose further that for some fixed positive integer c each S_i has non-empty intersection with at least m ? c of the remaining subsets. Then there is a least positive integer M(c) depending only on c such that either m ? n or m ? M(c).     

An umbral calculus for polynomials characterizing U(n) tensor operators

After the change of variables Δ_i = γ_i ? δ_i and x_{i,i + 1} = δ_i ? δ_{i + 1} we show that the invariant polynomials _μG⁽ⁿ⁾_q(, Δ_i, ; , x_i,i+1,) characterizing U(n) tensor operators 〈p, q,…, q, 0,…, 0〉 become an integral linear combination of Schur functions S_λ(γ ? δ) in the symbol γ ? δ, where γ ? δ denotes the difference of the two sets of variables {γ₁ ,…, γ_n} and {δ₁ ,…, δ_n}. We obtain a similar result for the yet more general bisymmetric polynomials ^m_μG⁽ⁿ⁾_q(γ₁ ,…, γ_n; δ₁ ,…, δ_m). Making use of properties of skew Schur functions $\text{S}{}_{\mathrm{<mtext>\lambda </mtext><mtext>\rho </mtext>}}$ and S_λ(γ ? δ) we put together an umbral calculus for ^m_μG⁽ⁿ⁾_q(γ; δ). That is, working entirely with polynomials, we uniquely determine ^m_μG⁽ⁿ⁾_q(γ; δ) from ^m_μG⁽ⁿ⁾_{q ? 1}(γ; δ) and combinatorial rules involving Ferrers diagrams (i.e., partitions), provided that n ≥ (μ + 1)q. (This restriction does not interfere with writing the general case of ^m_μG⁽ⁿ⁾_q(γ; δ) as a linear combination of S_λ(γ ? δ).) As an application we deduce “conjugation” symmetry for ⁿ_μG⁽ⁿ⁾_q(γ; δ) from “transposition” symmetry by showing that these two symmetries are equivalent.     

Stieltjes- and Geronimus-type polynomials

This work is an extension to the formal case of a previous work by Monegato [5].A Stieltjes-type polynomial is a polynomial of degree (n + 1), E_n+1, orthogonal with respect to the functional \s{;c̃_i = c(P_n(x)xⁱ), i = 0, 1, 2,…\s}, where c is a functional defined by the series f(t) = ∑^∞_i=0c_itⁱ. E_n+1 is of important use in the estimation of the error in Padé approximation. An iteration of the construction of E_n+1 is attempted. (Sections 1, 2, 3, 4).In the last section, we study the properties of the polynomial S_n associated with E_n+1 with respect to another functional c̄. S_n is called a Geronimus-type polynomial. It is shown that S_n verifies the system c(P_nS_nG_k) = 0 for k = 1,…,n, where the G_k's are orthogonal with respect to c̄.