Search

There are two established gradings on Leavitt path algebras associated with ultragraphs, namely the grading by the integers group and the grading by the free group on the edges. In this paper, we characterize properties of these gradings in terms of the underlying combinatorial properties of the ultragraphs. More precisely, we characterize when the gradings are strong or epsilon-strong. The results regarding the free group on the edges are new also in the context of Leavitt path algebras of graphs. Finally, we also describe the relation between the strongness of the integer grading on an ultragraph Leavitt path algebra and the saturation of the gauge action associated with the corresponding ultragraph C*-algebra.

A Leavitt labelled path algebra over a commutative unital ring is associated with a labelled space, generalizing Leavitt path algebras associated with graphs and ultragraphs as well as torsion-free commutative algebras generated by idempotents. We show that Leavitt labelled path algebras can be realized as partial skew group rings, Steinberg algebras, and Cuntz-Pimsner algebras. Via these realizations we obtain generalized uniqueness theorems, a description of diagonal preserving isomorphisms and we characterize simplicity of Leavitt labelled path algebras. In addition, we prove that a large class of partial skew group rings can be realized as Leavitt labelled path algebras.

The Thue number $\pi(G)$ of a graph $G$ is the minimum number of colors needed to color $G$ without creating a square on a path of $G$. For a graph class $C$, $\pi(C)$ is the supremum of $\pi(G)$ over the graphs $G\in C$. The Thue number has been investigated for famous minor-closed classes: $\pi(tree)=4$, $7\le\pi(outerplanar)\le12$, and $11\le\pi(planar)\le768$. Following a suggestion of Grytczuk, we consider the generalized parameters $\pi_k(C)$ such that only squares of period at least $k$ must be avoided. Thus, $\pi(C)=\pi_1(C)$. We show that $\pi_5(tree)=2$, $\pi_2(tree)=3$, and $\pi_k(planar)\ge11$ for every fixed $k$.

The representations of a $k$-graph $C^*$-algebra $C^*(\Lambda)$ which arise from $\Lambda$-semibranching function systems are closely linked to the dynamics of the $k$-graph $\Lambda$. In this paper, we undertake a systematic analysis of the question of irreducibility for these representations. We provide a variety of necessary and sufficient conditions for irreducibility, as well as a number of examples indicating the optimality of our results. We also explore the relationship between irreducible $\Lambda$-semibranching representations and purely atomic representations of $C^*(\Lambda)$. Throughout the paper, we work in the setting of row-finite source-free $k$-graphs; this paper constitutes the first analysis of $\Lambda$-semibranching representations at this level of generality.

Here, we explore the combination of sub-wavelength, two-dimensional atomic arrays and Rydberg interactions as a powerful platform to realize strong, coherent interactions between individual photons with high fidelity. In particular, the spatial ordering of the atoms guarantees efficient atom-light interactions without the possibility of scattering light into unwanted directions, for example, allowing the array to act as a perfect mirror for individual photons. In turn, Rydberg interactions enable single photons to alter the optical response of the array within a potentially large blockade radius $R_b$, which can effectively punch a large "hole" for subsequent photons. We show that such a system enables a coherent photon-photon gate or switch, with an error scaling $\sim R_b^{-4}$ that is significantly better than the best known scaling in a disordered ensemble. We also investigate the optical properties of the system in the limit of strong input intensities. Although this a priori represents a complicated, many-body quantum driven dissipative system, we find that the behavior can be captured well by a semi-classical model based on holes punched in a classical mirror., Comment: 6 pages and 4 figures in the main text + 8 pages and 7 figures in the Appendix

An ultragraph gives rise to a labelled graph with some particular properties. In this paper we describe the algebras associated to such labelled graphs as groupoid algebras. More precisely, we show that the known groupoid algebra realization of ultragraph C*-algebras is only valid for ultragraphs for which the range of each edge is finite, and we extend this realization to any ultragraph (including ultragraphs with sinks). Using our machinery, we characterize the shift space associated to an ultragraph as the tight spectrum of the inverse semigroup associated to the ultragraph (viewed as a labelled graph). Furthermore, in the purely algebraic setting, we show that the algebraic partial action used to describe an ultragraph Leavitt path algebra as a partial skew group ring is equivalent to the dual of a topological partial action, and we use this to describe ultragraph Leavitt path algebras as Steinberg algebras. Finally, we prove generalized uniqueness theorems for both ultragraph C*-algebras and ultragraph Leavitt path algebras and characterize their abelian core subalgebras.

Recent research on information visualization has shown how individual differences act as a mediator on how users interact with visualization systems. We focus our exploratory study on whether personality has an effect on user preferences regarding idioms used for hierarchy, evolution over time, and comparison contexts. Specifically, we leverage all personality variables from the Five-Factor Model and the three dimensions from Locus of Control (LoC) with correlation and clustering approaches. The correlation-based method suggested that Neuroticism, Openness to Experience, Agreeableness, several facets from each trait, and the External dimensions from LoC mediate how much individuals prefer certain idioms. In addition, our results from the cluster-based analysis showed that Neuroticism, Extraversion, Conscientiousness, and all dimensions from LoC have an effect on preferences for idioms in hierarchy and evolution contexts. Our results support the incorporation of in-depth personality synergies with InfoVis into the design pipeline of visualization systems., Comment: 5 pages, 1 figure, 4 tables, short paper, IEEE VIS 2020

In this work we approach three-dimensional evolution algebras from certain constructions performed on two-dimensional algebras. More precisely, we provide four different constructions producing three-dimensional evolution algebras from two-dimensional algebras. Also we introduce two parameters, the annihilator stabilizing index and the socle stabilizing index, which are useful tools in the classification theory of these algebras. Finally, we use moduli sets as a convenient way to describe isomorphism classes of algebras.

Inspired by a recent novel work of Good and Meddaugh, we establish fundamental connections between shadowing, finite order shifts, and ultrametric complete spaces. We develop a theory of shifts of finite type for infinite alphabets. We call them shifts of finite order. We develop the basic theory of the shadowing property in general metric spaces, exhibiting similarities and differences with the theory in compact spaces. We connect these two theories in the setting of zero-dimensional complete spaces, showing that a uniformly continuous map of an ultrametric complete space has the finite shadowing property if, and only if, it is an inverse limit of a system of shifts of finite order satisfying the Mittag-Leffler Condition. Furthermore, in this context, we show that the shadowing property is equivalent to the finite shadowing property and the fulfillment of the Mittag-Leffler Condition in the inverse limit description of the system. As corollaries, we obtain that a variety of maps in ultrametric spaces have the shadowing property, such as similarities and, more generally, maps which themselves, or their inverses, have Lipschitz constant 1. Finally, we apply our results to the dynamics of $p$-adic integers and $p$-adic rationals., Comment: 40 pages

We show that, for an arbitrary graph, a regular ideal of the associated Leavitt path algebra is also graded. As a consequence, for a row-finite graph, we obtain that the quotient of the associated Leavitt path by a regular ideal is again a Leavitt path algebra and that Condition~(L) is preserved by quotients by regular ideals. Furthermore, we describe the vertex set of a regular ideal and make a comparison between the theory of regular ideals in Leavitt path algebras and in graph C*-algebras., Comment: First version has been significantly improved. We thank the journal referee and Dr. Pere Ara for their insightfull suggestions

We describe the centroid of some Leavitt path algebras. More precisely, we show that for Leavitt path algebras over a field $K$ that are simple its centroid is isomorphic to $K$, and for prime Leavitt path algebras its centroid is isomorphic to $K$ except if the graph is a row-finite comet, in which case the centroid is isomorphic to $K[x,x^{-1}]$.

We present a novel approach to engineer the photon correlations emerging from the interference between an input field and the field scattered by a single atom in free space. Nominally, the inefficient atom-light coupling causes the quantum correlations to be dominated by the input field alone. To overcome this issue, we propose the use of separate pump and probe beams, where the former increases the atomic emission to be comparable to the probe. Examining the second-order correlation function $g^{(2)}(\tau)$ of the total field in the probe direction, we find that the addition of the pump formally plays the same role as increasing the coupling efficiency. We show that one can tune the correlation function $g^{(2)}(0)$ from zero (perfect anti-bunching) to infinite (extreme bunching) by a proper choice of pump amplitude. We further elucidate the origin of these correlations in terms of the transient atomic state following the detection of a photon., Comment: 6 pages and 4 figures in the main text + 1 page of supplemental material

It is a conjecture that for the class of Leavitt path algebras associated to finite directed graphs, their graded Grothendieck groups $K_0^{\mathrm{gr}}$ are a complete invariant. For a Leavitt path algebra $L_{\mathsf k}(E)$, with coefficient in a field ${\mathsf k}$, the monoid of the positive cone of $K_0^{\mathrm{gr}}(L_{\mathsf k}(E))$ can be described completely in terms of the graph $E$. In this note we further investigate the structure of this "talented monoid", showing how it captures intrinsic properties of the graph and hence the structure of its associated Leavitt path algebras. In particular, for the class of strongly connected graphs, we show that the notion of the period of a graph can be completely described via the talented monoid. As an application, we will give a finer characterisation of the purely infinite simple Leavitt path algebras in terms of properties of the associated graph. We show that graded isomorphism of algebras preserve the period of the graphs, and obtain results giving more evidence to the graded classification conjecture., Comment: 29 pages; minor corrections from first version

We extend ultragraph shift spaces and the realization of ultragraph C*-algebras as partial crossed products to include ultragraphs with sinks (under a mild condition, called (RFUM2), which allow us to dismiss the use of filters) and we describe the associated transformation groupoid. Using these characterizations we study continuous orbit equivalence of ultragraph shift spaces (via groupoids) and KMS and ground states (via partial crossed products).

We prove two isomorphism-invariance theorems for groupoids associated with ultragraphs. These theorems characterize ultragraphs for which the topological full group of an associated groupoid is an isomorphism invariant. These results extend those of graph groupoids to ultragraph groupoids while providing another concrete example where the topological full group of a groupoid is a complete isomorphism invariant., Comment: 22 pages

We prove that every planar graph is the intersection graph of homothetic triangles in the plane., Comment: 6 pages

We completely characterize perfect, permutative, irreducible representations of an ultragraph Leavitt path algebra. For this we extend to ultragraph Leavitt path algebras Chen's construction of irreducible representations of Leavitt path algebras. We show that these representations can be built from branching system and characterize irreducible representations associated to perfect branching systems. Along the way we improve the characterization of faithfulness of Chen's irreducible representations.

Given an action $\varphi$ of of inverse semigroup $S$ on a ring $A$ (with domain of $\varphi(s)$ denoted by $D_{s^*}$) we show that if the ideals $D_e$, with $e$ an idempotent, are unital, then the skew inverse semigroup ring $A\rtimes S$ can be realized as the convolution algebra of an ample groupoid with coefficients in a sheaf of rings. Conversely, we show that the convolution algebra of an ample groupoid with coefficients in a sheaf of rings is isomorphic to a skew inverse semigroup ring of this sort. We recover known results in the literature for Steinberg algebras over a field as special cases.

Motivated by C*-algebra theory, ultragraph edge shift spaces generalize shifts of finite type to the infinite alphabet case. In this paper we study several notions of chaos for ultragraph shift spaces. More specifically, we show that Li-Yorke, Devaney and distributional chaos are equivalent conditions for ultragraph shift spaces, and characterize this condition in terms of a combinatorial property of the underlying ultragraph. Furthermore, we prove that such properties imply the existence of a compact, perfect set which is distributionally scrambled of type 1 in the ultragraph shift space (a result that is not known for a labelled edge shift (with the product topology) of an infinite graph).

In this paper we study representations of ultragraph Leavitt path algebras via branching systems and, using partial skew ring theory, prove the reduction theorem for these algebras. We apply the reduction theorem to show that ultragraph Leavitt path algebras are semiprime and to completely describe faithfulness of the representations arising from branching systems, in terms of the dynamics of the branching systems. Furthermore, we study permutative representations and provide a sufficient criteria for a permutative representation of an ultragraph Leavitt path algebra to be equivalent to a representation arising from a branching system. We apply this criteria to describe a class of ultragraphs for which every representation (satisfying a mild condition) is permutative and has a restriction that is equivalent to a representation arising from a branching system.

We show that if a planar graph $G$ has a plane straight-line drawing in which a subset $S$ of its vertices are collinear, then for any set of points, $X$, in the plane with $|X|=|S|$, there is a plane straight-line drawing of $G$ in which the vertices in $S$ are mapped to the points in $X$. This solves an open problem posed by Ravsky and Verbitsky in 2008. In their terminology, we show that every collinear set is free. This result has applications in graph drawing, including untangling, column planarity, universal point subsets, and partial simultaneous drawings., Comment: 29 pages, 12 figures

Planar graphs are the graphs with Dushnik-Miller dimension at most three (W. Schnyder, Planar graphs and poset dimension, Order 5, 323-343, 1989). Consider the intersection graph of interior disjoint axis parallel rectangles in the plane. It is known that if at most three rectangles intersect on a point, then this intersection graph is planar, that is it has Dushnik-Miller dimension at most three. This paper aims at generalizing this from the plane to $R^d$ by considering tilings of $R^d$ with axis parallel boxes, where at most $d+1$ boxes intersect on a point. Such tilings induce simplicial complexes and we will show that those simplicial complexes have Dushnik-Miller dimension at most $d+1$., Comment: 14 pages

We associate an square to any two dimensional evolution algebra. This geometric object is uniquely determined, does not depend on the basis and describes the structure and the behaviour of the algebra. We determine the identities of degrees at most four, as well as derivations and automorphisms. We look at the group of automorphisms as an algebraic group, getting in this form a new algebraic invariant. The study of associative representations of evolution algebras is also started and we get faithful representations for most two-dimensional evolution algebras. In some cases we prove that faithful commutative and associative representations do not exist, giving raise to the class of what could be termed as "exceptional" evolution algebras (in the sense of not admitting a monomorphism to an associative algebra with deformed product).

Recently, in connection with C*-algebra theory, the first author and Danilo Royer introduced ultragraph shift spaces. In this paper we define a family of metrics for the topology in such spaces, and use these metrics to study the existence of chaos in the shift. In particular we characterize all ultragraph shift spaces that have Li-Yorke chaos (an uncountable scrambled set), and prove that such property implies the existence of a perfect and scrambled set in the ultragraph shift space. Furthermore, this scrambled set can be chosen compact, what is not the case for a labelled edge shift (with the product topology) of an infinite graph.

We study relative Cohn path algebras, also known as Leavitt-Cohn path algebras, and we realize them as partial skew group rings (to do this we prove uniqueness theorems for relative Cohn path algebras). Furthermore, given any graph $E$ we define $E$-relative branching systems and prove how they induce representations of the associated relative Cohn path algebra. We give necessary and sufficient conditions for faithfulness of the representations associated to $E$-relative branching systems (this improves previous results known to Leavitt path algebras of row-finite graphs with no sinks). To prove this last result we show first a version, for relative Cohn-path algebras, of the reduction theorem for Leavitt path algebras., Comment: 20 pages; revised version; to appear in Journal of Pure and Applied Algebra

TD-Delaunay graphs, where TD stands for triangular distance, is a variation of the classical Delaunay triangulations obtained from a specific convex distance function. Bonichon et. al. noticed that every triangulation is the TD-Delaunay graph of a set of points in $\mathbb{R}^2$, and conversely every TD-Delaunay graph is planar. It seems natural to study the generalization of this property in higher dimensions. Such a generalization is obtained by defining an analogue of the triangular distance for $\mathbb{R}^d$. It is easy to see that TD-Delaunay complexes of $\mathbb{R}^{d-1}$ are of Dushnik-Miller dimension $d$. The converse holds for $d=2$ or $3$ and it was conjectured independently by Mary and Evans et. al. to hold for larger $d$. Here we disprove the conjecture already for $d = 4$., Comment: A short version appears in the proceedings of EuroCG 2017

Historically, the Natural Language Processing area has been given too much attention by many researchers. One of the main motivation beyond this interest is related to the word prediction problem, which states that given a set words in a sentence, one can recommend the next word. In literature, this problem is solved by methods based on syntactic or semantic analysis. Solely, each of these analysis cannot achieve practical results for end-user applications. For instance, the Latent Semantic Analysis can handle semantic features of text, but cannot suggest words considering syntactical rules. On the other hand, there are models that treat both methods together and achieve state-of-the-art results, e.g. Deep Learning. These models can demand high computational effort, which can make the model infeasible for certain types of applications. With the advance of the technology and mathematical models, it is possible to develop faster systems with more accuracy. This work proposes a hybrid word suggestion model, based on Naive Bayes and Latent Semantic Analysis, considering neighbouring words around unfilled gaps. Results show that this model could achieve 44.2% of accuracy in the MSR Sentence Completion Challenge.

Recently a generalization of shifts of finite type to the infinite alphabet case was proposed, in connection with the theory of ultragraph C*-algebras. In this work we characterize the class of continuous shift commuting maps between these spaces. In particular, we prove a Curtis-Hedlund-Lyndon type theorem and use it to completely characterize continuous, shift commuting, length preserving maps in terms of generalized sliding block codes., Comment: 14 pages