4 results
Search Results
Now showing 1 - 4 of 4
Article Citation - WoS: 24Gluing and Hilbert Functions of Monomial Curves(Amer Mathematical Soc, 2009) Arslan, Feza; Mete, Pinar; Sahin, MesutIn this article, by using the technique of gluing semigroups, we give infinitely many families of 1-dimensional local rings with non-decreasing Hilbert functions. More significantly, these are local rings whose associated graded rings are not necessarily Cohen-Macaulay. In this sense, we give an effective technique for constructing large families of 1-dimensional Gorenstein local rings associated to monomial curves, which support Rossi's conjecture saying that every Gorenstein local ring has a non-decreasing Hilbert function.Article Citation - WoS: 4Citation - Scopus: 4Uncorrelatedness sets for random variables with given distributions(Amer Mathematical Soc, 2005) Ostrovska, SLet xi(1) and xi(2) be random variables having finite moments of all orders. The set U(xi(1),xi(2)) := {( j, l) is an element of N-2 : E(xi(1)(j)xi(2)(l)) = E(xi(1)(j)) E(xi(2)(l))} is said to be an uncorrelatedness set of xi(1) and xi(2). It is known that in general, an uncorrelatedness set can be arbitrary. Simple examples show that this is not true for random variables with given distributions. In this paper we present a wide class of probability distributions such that there exist random variables with given distributions from the class having a prescribed uncorrelatedness set. Besides, we discuss the sharpness of the obtained result.Article Citation - WoS: 2Citation - Scopus: 2Distortion of Embeddings of Binary Trees Into Diamond Graphs(Amer Mathematical Soc, 2018) Leung, Siu Lam; Nelson, Sarah; Ostrovska, Sofiya; Ostrovskii, MikhailDiamond graphs and binary trees are important examples in the theory of metric embeddings and also in the theory of metric characterizations of Banach spaces. Some results for these families of graphs are parallel to each other; for example superreflexivity of Banach spaces can be characterized both in terms of binary trees (Bourgain, 1986) and diamond graphs (Johnson-Schechtman, 2009). In this connection, it is natural to ask whether one of these families admits uniformly bilipschitz embeddings into the other. This question was answered in the negative by Ostrovskii (2014), who left it open to determine the order of growth of the distortions. The main purpose of this paper is to get a sharp up-to-a-logarithmic-factor estimate for the distortions of embeddings of binary trees into diamond graphs and, more generally, into diamond graphs of any finite branching k >= 2. Estimates for distortions of embeddings of diamonds into infinitely branching diamonds are also obtained.Article Citation - WoS: 7Producing Set-Theoretic Complete Intersection Monomial Curves in Pn<(Amer Mathematical Soc, 2009) Sahin, MesutIn this paper we describe an algorithm for producing infinitely many examples of set-theoretic complete intersection monomial curves in Pn+1, starting with a single set-theoretic complete intersection monomial curve in P-n. Moreover we investigate the numerical criteria to decide when these monomial curves can or cannot be obtained via semigroup gluing.
