A graph-theoretic approach for comparing dimensions of components in simply-graded algebras

Any simple group-grading of a finite dimensional complex algebra induces a natural family of digraphs. We prove that in a digraph without parallel edges, the number of pairs of vertices having a common in-neighbor or a common out-neighbor is at least the number of edges. We deduce that for any simple group-grading, the dimension of the trivial component is maximal.     

Crack growth resistance of shape memory alloys by means of a cohesive zone model

Crack growth resistance of shape memory alloys (SMAs) is dominated by the transformation zone in the vicinity of the crack tip. In this study, the transformation toughening behavior of a slowly propagating crack in an SMA under plane strain conditions and mode I deformation is numerically investigated. A small-scale transformation zone is assumed. A cohesive zone model is implemented to simulate crack growth within a finite element scheme. Resistance curves are obtained for a range of parameters that specify the cohesive traction-separation constitutive law. It is found that the choice of the cohesive strength t₀ has a great influence on the toughening behavior of the material. Moreover, the reversibility of the transformation can significantly reduce the toughening of the alloy. The shape of the initial transformation zone, as well as that of a growing crack is determined. The effect of the Young's moduli ratio of the martensite and austenite phases is examined.     

On the transformation toughening of a crack along an interface between a shape memory alloy and an isotropic medium

In this study, a bilinear cohesive zone model is employed to describe the transformation toughening behavior of a slowly propagating crack along an interface between a shape memory alloy and a linear elastic or elasto-plastic isotropic material. Small scale transformation zones and plane strain conditions are assumed. The crack growth is numerically simulated within a finite element scheme and its transformation toughening is obtained by means of resistance curves. It is found that the choice of the cohesive strength t₀ and the stress intensity factor phase angle φ greatly influence the toughening behavior of the bimaterial. The presented methodology is generalized for the case of an interface crack between a fiber reinforced shape memory alloy composite and a linear elastic, isotropic material. The effect of the cohesive strength t₀, as well as the fiber volume fraction are examined.     

Convolutions of cantor measures without resonance

Denote by µ _a the distribution of the random sum \((1 - a)\sum\nolimits_{j = 0}^\infty {{w_j}{a^j}} \), where P(ω _j = 0) = P(ω _j = 1) = 1/2 and all the choices are independent. For 0 < a < 1/2, the measure µ _a is supported on C _a , the central Cantor set obtained by starting with the closed united interval, removing an open central interval of length (1 ? 2a), and iterating this process inductively on each of the remaining intervals. We investigate the convolutions µ _a * (µ _b ° S _λ ^?1 ), where S _λ (x) = λx is a rescaling map. We prove that if the ratio log b/ log a is irrational and λ ≠ 0, then

$D({\mu _a} * ({\mu _b} \circ S_\lambda ^{ - 1})) = \min ({\dim _H}({C_a}) + {\dim _H}({C_b}),1)$

, where D denotes any of correlation, Hausdorff or packing dimension of a measure.

We also show that, perhaps surprisingly, for uncountably many values of λ the convolution µ_1/4* (µ_1/3 ° S _λ ^?1 ) is a singular measure, although dim _H (C _1/4) + dim _H (C _1/3) > 1 and log(1/3)/ log(1/4) is irrational.     

The action of a few permutations on r-tuples is quickly transitive

We prove that for every r and d≥2 there is a C such that for most choices of d permutations π₁, π₂,…,π_d of S_n, the following holds: for any two r-tuples of distinct elements in {1,…,n}, there is a product of less than C log n of the π_is which map the first r-tuple to the second. Although we came across this problem while studying a rather unrelated cryptographic problem, it belongs to a general context of which random Cayley graph quotients of S_n are good expanders. © 1998 John Wiley & Sons, Inc. Random Struct. Alg., 12: 335–350, 1998     

New Coins From Old: Computing With Unknown Bias

Suppose that we are given a function f : (0, 1)→(0,1) and, for some unknown p∈(0, 1), a sequence of independent tosses of a p-coin (i.e., a coin with probability p of “heads”). For which functions f is it possible to simulate an f(p)-coin? This question was raised by S. Asmussen and J. Propp. A simple simulation scheme for the constant function f(p)≡1/2 was described by von Neumann (1951); this scheme can be easily implemented using a finite automaton. We prove that in general, an f(p)-coin can be simulated by a finite automaton for all p ∈ (0, 1), if and only if f is a rational function over ℚ. We also show that if an f(p)-coin can be simulated by a pushdown automaton, then f is an algebraic function over ℚ; however, pushdown automata can simulate f(p)-coins for certain nonrational functions such as . These results complement the work of Keane and O’Brien (1994), who determined the functions f for which an f(p)-coin can be simulated when there are no computational restrictions on the simulation scheme. * Supported by a Miller Fellowship. † Supported in part by NSF Grant DMS-0104073 and by a Miller Professorship. ‡ This work is supported under a National Science Foundation Graduate Research Fellowship.     

Statistics on wreath products and generalized binomial-stirling numbers

Various statistics on wreath products are defined via canonical words, “colored” right to left minima and “colored” descents. It is shown that refined counts with respect to these statistics have nice recurrence formulas of binomial-Stirling type. These extended Stirling numbers determine (via matrix inversion) dual systems, which are also shown to have combinatorial realizations within the wreath product. The above setting also gives rise to a MacMahon-type equi-distribution theorem over subsets with prescribed statistics. Partially supported by Minerva Grant No. 8441 and by EC's IHRP Programme, within the Research Training Network “Algebraic Combinatorics in Europe”, grant HPRN-CT-2001-00272. Partially supported by EC's IHRP Programme, within the Research Training Network “Algebraic Combinatorics in Europe”, grant HPRN-CT-2001-00272.     

Enumeration and randomized constructions of hypertrees

Over 30 years ago, Kalai proved a beautiful d‐dimensional analog of Cayley's formula for the number of n‐vertex trees. He enumerated d‐dimensional hypertrees weighted by the squared size of their (d ? 1)‐dimensional homology group. This, however, does not answer the more basic problem of unweighted enumeration of d‐hypertrees, which is our concern here. Our main result, Theorem 1.4, significantly improves the lower bound for the number of d‐hypertrees. In addition, we study a random 1‐out model of d‐complexes where every (d ? 1)‐dimensional face selects a random d‐face containing it, and show that it has a negligible d‐dimensional homology.     

Equivalence of positive Hausdorff measure and the open set condition for self-conformal sets

A compact set is self-conformal if it is a finite union of its images by conformal contractions. It is well known that if the conformal contractions satisfy the ``open set condition' (OSC), then has positive -dimensional Hausdorff measure, where is the solution of Bowen's pressure equation. We prove that the OSC, the strong OSC, and positivity of the -dimensional Hausdorff measure are equivalent for conformal contractions; this answers a question of R. D. Mauldin. In the self-similar case, when the contractions are linear, this equivalence was proved by Schief (1994), who used a result of Bandt and Graf (1992), but the proofs in these papers do not extend to the nonlinear setting.