Nonvanishing cohomology and classes of Gorenstein rings

We give counterexamples to the following conjecture of Auslander: given a finitely generated module M over an Artin algebra Λ, there exists a positive integer n_M such that for all finitely generated Λ-modules N, if Ext_Λⁱ(M,N)=0 for all i?0, then Ext_Λⁱ(M,N)=0 for all i?n_M. Some of our examples moreover yield homologically defined classes of commutative local rings strictly between the class of local complete intersections and the class of local Gorenstein rings.     

Random Walks And The Colored Jones Function

It can be conjectured that the colored Jones function of a knot can be computed in terms of counting paths on the graph of a planar projection of a knot. On the combinatorial level, the colored Jones function can be replaced by its weight system. We give two curious formulas for the weight system of a colored Jones function: one in terms of the permanent of a matrix associated to a chord diagram, and another in terms of counting paths of intersecting chords. Electronic supplementary material to this article is available at and is accessible to authorized users. * S. G. was partially supported by an NSF and by an Israel-US BSF grant. † M. L. was partly supported by GAUK 158 grant and by the Project LN00A056 of the Czech Ministry of Education.     

Shape Optimization for Semi-Linear Elliptic Equations Based on an Embedding Domain Method

We study a class of shape optimization problems for semi-linear elliptic equations with Dirichlet boundary conditions in smooth domains in ℝ². A part of the boundary of the domain is variable as the graph of a smooth function. The problem is equivalently reformulated on a fixed domain. Continuity of the solution to the state equation with respect to domain variations is shown. This is used to obtain differentiability in the general case, and moreover a useful formula for the gradient of the cost functional in the case where the principal part of the differential operator is the Laplacian. Online publication 23 January 2004.     

Spectral enhancement of Polish vowels to improve their identification by hearing impaired listeners

Abnormalities in the cochlear function usually cause broadening of the auditory filters which reduces the speech intelligibility. An attempt to apply a spectral enhancement algorithm has been undertaken to improve the identification of Polish vowels by subjects with cochlear-based hearing-impairment. The identification scores of natural (unprocessed) vowels and spectrally enhanced (processed) vowels has been measured for hearing-impaired subjects. It has been found that spectral enhancement improves vowel scores by about 10% for those subjects, however, a wide variation in individual performance among subjects has been observed. The overall vowels identification scores obtained were 85% for natural vowels and 96% for spectrally enhanced vowels.     

Measurement of the K α to L α and K β to L β intensity ratios of seven elements in the atomic number range 52≤ Z ≤62 using photoionization at 59.5 keV1

The Kα to Lα and Kβ to Lβ intensity ratios of seven elements have been measured following photoionization at 59.5 keV by using a Si (Li) detector (FWHM=155 eV at 5.96 keV). The intensity ratios were determined by measuring K and L x-rays emitted from a standard target of a given element. The theoretical values of the Kα to Lα and Kβ to Lβ intensity ratios were calculated using theoretically tabulated values of shell/subshell photoionization cross sections, fluorescence yields, Coster-Kronig transition probabilities, and radiative decay rates for ηKLi≠ and ηKLi=0. The measured values are in good agreement with theoretical results. From Optika i Spektroskopiya, Vol. 97, No. 2, 2004, pp. 186–189. Original English Text Copyright ? 2004 by A. Kü?ük?nder, S?ğüt, E. Kü?ük?nder, Büyükkasap. This article was submitted by the authors in English.     

Combined intra-intermolecular criss-cross cycloaddition of a new fluorinated unsymmetrical allenylazine with alkynes

The reaction of a new fluorinated unsymmetrical allenylazine with dimethyl acetylenedicarboxylate and phenylacetylene affords the combined intra-intermolecular criss-cross cycloaddition products, 2,3-disubstituted-1,10-diazatricyclo[5.2.1.0^4,10]deca-2,6-diene derivatives. The products contain three fused five-membered rings with two nitrogen atoms within an unsaturated heterocyclic system. The structures were assigned using 2D NMR correlations and in the case of the phenylacetylene adduct by X-ray structure analysis.     

Asymptotic properties of computationally efficient alternative estimators for a class of multivariate normal models

Parameters of Gaussian multivariate models are often estimated using the maximum likelihood approach. In spite of its merits, this methodology is not practical when the sample size is very large, as, for example, in the case of massive georeferenced data sets. In this paper, we study the asymptotic properties of the estimators that minimize three alternatives to the likelihood function, designed to increase the computational efficiency. This is achieved by applying the information sandwich technique to expansions of the pseudo-likelihood functions as quadratic forms of independent normal random variables. Theoretical calculations are given for a first-order autoregressive time series and then extended to a two-dimensional autoregressive process on a lattice. We compare the efficiency of the three estimators to that of the maximum likelihood estimator as well as among themselves, using numerical calculations of the theoretical results and simulations.     

Lyapunov-type inequalities for nonlinear systems

In this paper, by using elementary analysis, we establish some new Lyapunov-type inequalities for nonlinear systems of differential equations, special cases of which contain the well-known equations such as Emden-Fowler-type and half-linear equations. The inequalities obtained here can be used as handy tools in the study of qualitative behaviour of solutions of the associated equations.     

The diameter of randomly perturbed digraphs and some applications

The central observation of this paper is that if εn random arcs are added to any n‐node strongly connected digraph with bounded degree then the resulting graph has diameter 𝒪(lnn) with high probability. We apply this to smoothed analysis of algorithms and property testing. Smoothed Analysis: Recognizing strongly connected digraphs is a basic computational task in graph theory. Even for digraphs with bounded degree, it is NL‐complete. By XORing an arbitrary bounded degree digraph with a sparse random digraph R ∼ 𝔻_n,ε/n we obtain a “smoothed” instance. We show that, with high probability, a log‐space algorithm will correctly determine if a smoothed instance is strongly connected. We also show that if NL ⫅̸ almost‐L then no heuristic can recognize similarly perturbed instances of (s,t)‐connectivity. Property Testing: A digraph is called k‐linked if, for every choice of 2k distinct vertices s₁,…,s_k,t₁,…,t_k, the graph contains k vertex disjoint paths joining s_r to t_r for r = 1,…,k. Recognizing k‐linked digraphs is NP‐complete for k ≥ 2. We describe a polynomial time algorithm for bounded degree digraphs, which accepts k‐linked graphs with high probability, and rejects all graphs that are at least εn arcs away from being k‐linked. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007