Rings, Group Rings, and Their Graphs

We associate some graphs to a ring R and we investigate the interplay between the ring-theoretic properties of R and the graph-theoretic properties of the graphs associated to R. Let Z(R) be the set of zero-divisors of R. We define an undirected graph ᴦ(R) with nonzero zero-divisors as vertices and distinct vertices x and y are adjacent if xy=0 or yx=0. We investigate the Isomorphism Problem for zero-divisor graphs of group rings RG. Let Sk denote the sphere with k handles, where k is a non-negative integer, that is, Sk is an oriented surface of genus k. The genus of a graph is the minimal integer n such that the graph can be embedded in Sn. The annihilating-ideal graph of R is defined as the graph AG(R) with the set of ideals with nonzero annihilators as vertex such that two distinct vertices I and J are adjacent if IJ=(0). We characterize Artinian rings whose annihilating-ideal graphs have finite genus. Finally, we extend the definition of the annihilating-ideal graph to non-commutative rings.

Rees semigroups of digraphs for classification of data

Recent research has motivated the investigation of the weights of ideals in semiring constructions based on semigroups. The present paper introduces Rees semigroups of directed graphs. This new construction is a common generalization of Rees matrix semigroups and incidence semigroups of digraphs. For each finite subsemigroup S of the Rees semigroup of a digraph and for every zero-divisor-free idempotent semiring F with identity element, our main theorem describes all ideals J in the semigroup semiring F0[S] such that J has the largest possible weight.

Class Notes for Math 918: Homological Conjectures, Instructor Tom Marley

This course was an overview of what are known as the “Homological Conjectures,” in particular, the Zero Divisor Conjecture, the Rigidity Conjecture, the Intersection Conjectures, Bass’ Conjecture, the Superheight Conjecture, the Direct Summand Conjecture, the Monomial Conjecture, the Syzygy Conjecture, and the big and small Cohen Macaulay Conjectures. Many of these are shown to imply others. This document contains notes for a course taught by Tom Marley during the 2009 spring semester at the University of Nebraska-Lincoln. The notes loosely follow the treatment given in Chapters 8 and 9 of Cohen-Macaulay Rings, by W. Bruns and J. Herzog, although many other sources, including articles and monographs by Peskine, Szpiro, Hochster, Huneke, Grith, Evans, Lyubeznik, and Roberts (to name a few), were used. Special thanks to Laura Lynch for putting these notes into LaTeX.

The Noether-Lefschetz theorem for the divisor class group

Let X be a normal projective threefold over a field of characteristic zero and vertical bar L vertical bar be a base-point free, ample linear system on X. Under suitable hypotheses on (X, vertical bar L vertical bar), we prove that for a very general member Y is an element of vertical bar L vertical bar, the restriction map on divisor class groups Cl(X) -> Cl(Y) is an isomorphism. In particular, we are able to recover the classical Noether-Lefschetz theorem, that a very general hypersurface X subset of P-C(3) of degree >= 4 has Pic(X) congruent to Z.

Nonuniform random geometric graphs with location-dependent radii

We propose a distribution-free approach to the study of random geometric graphs. The distribution of vertices follows a Poisson point process with intensity function n f(center dot), where n is an element of N, and f is a probability density function on R-d. A vertex located at x connects via directed edges to other vertices that are within a cut-off distance r(n)(x). We prove strong law results for (i) the critical cut-off function so that almost surely, the graph does not contain any node with out-degree zero for sufficiently large n and (ii) the maximum and minimum vertex degrees. We also provide a characterization of the cut-off function for which the number of nodes with out-degree zero converges in distribution to a Poisson random variable. We illustrate this result for a class of densities with compact support that have at most polynomial rates of decay to zero. Finally, we state a sufficient condition for an enhanced version of the above graph to be almost surely connected eventually.

The Jordan canonical form for a class of weighted directed graphs

Recently, Cardon and Tuckfield (2011) [1] have described the Jordan canonical form for a class of zero-one matrices, in terms of its associated directed graph. In this paper, we generalize this result to describe the Jordan canonical form of a weighted adjacency matrix A in terms of its weighted directed graph.

A multi-hypothesis topological SLAM approach for loop closing on edge-ordered graphs

We present a method for topological SLAM that specifically targets loop closing for edge-ordered graphs. Instead of using a heuristic approach to accept or reject loop closing, we propose a probabilistically grounded multi-hypothesis technique that relies on the incremental construction of a map/state hypothesis tree. Loop closing is introduced automatically within the tree expansion, and likely hypotheses are chosen based on their posterior probability after a sequence of sensor measurements. Careful pruning of the hypothesis tree keeps the growing number of hypotheses under control and a recursive formulation reduces storage and computational costs. Experiments are used to validate the approach.

Zero- one- and two-dimensional hydrogen-bonded structures in the 1:1 proton-transfer compounds of 4,5-dichlorophthalic acid with the monocyclic heteroaromatic Lewis bases 2-aminopyrimidine, nicotinamide and isonicotinamide

The structures of the anhydrous 1:1 proton-transfer compounds of 4,5-dichlorophthalic acid (DCPA) with the monocyclic heteroaromatic Lewis bases 2-aminopyrimidine, 3-(aminocarboxy) pyridine (nicotinamide) and 4-(aminocarbonyl) pyridine (isonicotinamide), namely 2-aminopyrimidinium 2-carboxy-4,5-dichlorobenzoate C4H6N3+ C8H3Cl2O4- (I), 3-(aminocarbonyl) pyridinium 2-carboxy-4,5-dichlorobenzoate C6H7N2O+ C8H3Cl2O4- (II) and the unusual salt adduct 4-(aminocarbonyl) pyridinium 2-carboxy-4,5-dichlorobenzoate 2-carboxymethyl-4,5-dichlorobenzoic acid (1/1/1) C6H7N2O+ C8H3Cl2O4-.C9H6Cl2O4 (III) have been determined at 130 K. Compound (I) forms discrete centrosymmetric hydrogen-bonded cyclic bis(cation--anion) units having both R2/2(8) and R2/1(4) N-H...O interactions. In compound (II) the primary N-H...O linked cation--anion units are extended into a two-dimensional sheet structure via amide-carboxyl and amide-carbonyl N-H...O interactions. The structure of (III) reveals the presence of an unusual and unexpected self-synthesized methyl monoester of the acid as an adduct molecule giving one-dimensional hydrogen-bonded chains. In all three structures the hydrogen phthalate anions are

Synthesis, characterization of palygorskite supported zero-valent iron and its application for methylene blue adsorption

In this work, natural palygorskite impregnated with zero-valent iron (ZVI) was prepared and characterised. The combination of ZVI particles on surface of fibrous palygorskite can help to overcome the disadvantage of ultra-fine powders which may have strong tendency to agglomerate into larger particles, resulting in an adverse effect on both effective surface area and catalyst performance. There is a significant increase of methylene blue (MB) decolourized efficiency on acid treated palygorskite with ZVI grafted, within 5 mins, the concentration of MB in the solution was decreased from 94 mg/L to around 20 mg/L and the equilibration was reached at about 30 to 60 mins with only around 10 mg/L MB remained in solution. Changes in the surface and structure of prepared materials were characterized using X-ray diffraction (XRD), infrared (IR) spectroscopy, surface analysing and scanning electron microscopy (SEM) with element analysis and mapping. Comparing with zero-valent iron and palygorskite, the presence of zero-valent iron reactive species on the palygorskite surface strongly increases the decolourization capacity for methylene blue, and it is significant for providing novel modified clay catalyst materials for the removal of organic contaminants from waste water.

CTCombine : rotating and combining CT data with an accurate detector model, to simulate radiotherapy portal imaging at non-zero beam angles

Established Monte Carlo user codes BEAMnrc and DOSXYZnrc permit the accurate and straightforward simulation of radiotherapy experiments and treatments delivered from multiple beam angles. However, when an electronic portal imaging detector (EPID) is included in these simulations, treatment delivery from non-zero beam angles becomes problematic. This study introduces CTCombine, a purpose-built code for rotating selected CT data volumes, converting CT numbers to mass densities, combining the results with model EPIDs and writing output in a form which can easily be read and used by the dose calculation code DOSXYZnrc. The geometric and dosimetric accuracy of CTCombine’s output has been assessed by simulating simple and complex treatments applied to a rotated planar phantom and a rotated humanoid phantom and comparing the resulting virtual EPID images with the images acquired using experimental measurements and independent simulations of equivalent phantoms. It is expected that CTCombine will be useful for Monte Carlo studies of EPID dosimetry as well as other EPID imaging applications.

Poisson, Poisson-gamma and zero-inflated regression models of motor vehicle crashes: balancing statistical fit and theory

There has been considerable research conducted over the last 20 years focused on predicting motor vehicle crashes on transportation facilities. The range of statistical models commonly applied includes binomial, Poisson, Poisson-gamma (or negative binomial), zero-inflated Poisson and negative binomial models (ZIP and ZINB), and multinomial probability models. Given the range of possible modeling approaches and the host of assumptions with each modeling approach, making an intelligent choice for modeling motor vehicle crash data is difficult. There is little discussion in the literature comparing different statistical modeling approaches, identifying which statistical models are most appropriate for modeling crash data, and providing a strong justification from basic crash principles. In the recent literature, it has been suggested that the motor vehicle crash process can successfully be modeled by assuming a dual-state data-generating process, which implies that entities (e.g., intersections, road segments, pedestrian crossings, etc.) exist in one of two states—perfectly safe and unsafe. As a result, the ZIP and ZINB are two models that have been applied to account for the preponderance of “excess” zeros frequently observed in crash count data. The objective of this study is to provide defensible guidance on how to appropriate model crash data. We first examine the motor vehicle crash process using theoretical principles and a basic understanding of the crash process. It is shown that the fundamental crash process follows a Bernoulli trial with unequal probability of independent events, also known as Poisson trials. We examine the evolution of statistical models as they apply to the motor vehicle crash process, and indicate how well they statistically approximate the crash process. We also present the theory behind dual-state process count models, and note why they have become popular for modeling crash data. A simulation experiment is then conducted to demonstrate how crash data give rise to “excess” zeros frequently observed in crash data. It is shown that the Poisson and other mixed probabilistic structures are approximations assumed for modeling the motor vehicle crash process. Furthermore, it is demonstrated that under certain (fairly common) circumstances excess zeros are observed—and that these circumstances arise from low exposure and/or inappropriate selection of time/space scales and not an underlying dual state process. In conclusion, carefully selecting the time/space scales for analysis, including an improved set of explanatory variables and/or unobserved heterogeneity effects in count regression models, or applying small-area statistical methods (observations with low exposure) represent the most defensible modeling approaches for datasets with a preponderance of zeros