Related papers: Approximately inner derivations

We use non-symmetric distances to give a self-contained account of C*-algebra filters and their corresponding compact projections, simultaneously simplifying and extending their general theory.

We use a version of the Trotter-Kato approximation theorem for strongly continuous semigroups in order to study flows on growing networks. For that reason we use the abstract notion of direct limits in the sense of category theory.

We start an analysis of geometric properties of a structure relative to a reduct. In particular, we look at definability of groups and fields in this context. In the relatively one-based case, every definable group is isogenous to a…

We study the structure of the generator of a symmetric, conservative quantum dynamical semigroup with norm-bounded generator on a von Neumann algebra equipped with a faithful semifinite trace. For von Neumann algebras with abelian commutant…

Using techniques of the theory of semigroups of linear operators we study the question of approximating solutions to equations governing diffusion in thin layers separated by a semi-permeable membrane. We show that as thickness of the…

We study sublinear algorithms for two fundamental graph problems, MAXCUT and correlation clustering. Our focus is on constructing core-sets as well as developing streaming algorithms for these problems. Constant space algorithms are known…

We give several algebraic bounds for percolation on directed and undirected graphs: proliferation of strongly-connected clusters, proliferation of in- and out-clusters, and the transition associated with the number of giant components.

We consider perturbations of unitary minimal models by boundary fields. Initially we consider the models in the limit as c -> 1 and find that the relevant boundary fields all have simple interpretations in this limit. This interpretation…

We consider a finite difference approximation of mean curvature flow for axisymmetric surfaces of genus zero. A careful treatment of the degeneracy at the axis of rotation for the one dimensional partial differential equation for a…

We study the number of clusters in two-dimensional (2d) critical percolation, N_Gamma, which intersect a given subset of bonds, Gamma. In the simplest case, when Gamma is a simple closed curve, N_Gamma is related to the entanglement entropy…

The purpose of this paper is to characterize one-dimensional local domains, or more in general reduced, in terms of its Macaulay's inverse system. This leads to study almost finitely generated modules in the divided power ring. We…

We give the first nonconstant lower bounds for the approximability of the Independent Set Problem on the Power Law Graphs. These bounds are of the form $n^{\epsilon}$ in the case when the power law exponent satisfies $\beta <1$. In the case…

Let $\Gamma$ denote a distance-regular graph with diameter $D\geq 3$ and Bose-Mesner algebra $M$. For $\theta\in C\cup \infty$ we define a 1 dimensional subspace of $M$ which we call $M(\theta)$. If $\theta\in C$ then $M(\theta)$ consists…

To any directed graph we associate an algebra with edges of the graph as generators and with relations defined by all pairs of directed paths with the same origin and terminus. Such algebras are related to factorizations of polynomials over…

Part I of this paper embeds the AC power flow problem with voltage control and exponential load model in the complex plane. Modeling the action of network controllers that regulate the magnitude of voltage phasors is a challenging task in…

We define the notions of relative $e$-spectra, with respect to $E$-operators, relative closures, and relative generating sets. We study properties connected with relative $e$-spectra and relative generating sets.

A recently introduced cellular automaton model for the description of traffic flow is investigated. It generalises asymmetric exclusion models which have attracted a lot of interest in the past. We calculate the so-called fundamental…

In this article, we extend a well known result about real rank zero C* Algebras to higher real rank C* Algebras. The main technique used here is similar to the method in which we approximate continuous functions using projections. What we…

A major line of questions in quantum information and computing asks how quickly locally random circuits converge to resemble global randomness. In particular, approximate k-designs are random unitary ensembles that resemble random circuits…

We consider several distances between two sets of points, which are modifications of the Hausdorff metric, and apply them to describe some fractals such as $\delta$-quasi-self-similar sets, and some other geometric notions in Euclidean…