arXiv subjects

Daniel Gonçalves

Publications and source records attributed to Daniel Gonçalves.

106 records · Page 6Linked to original sources

arXiv2014

Branching systems and representations of Cohn-Leavitt path algebras of separated graphs

We construct for each separated graph (E;C) a family of branching systems over a set X and show how each branching system induces a representation of the Cohn-Leavitt path algebra associated to (E;C) as homomorphisms over the module of functions in X. We also prove that the abelianized Cohn-Leavitt path algebra of a separated graph with no loops can be written as an amalgamated free product of abelianized Cohn-Leavitt algebras that can be faithfully represented via branching systems.

math.RA↗

arXiv2014

Understanding Individual Differences: Towards Effective Mobile Interface Design and Adaptation for the Blind

No two people are alike. We usually ignore this diversity as we have the capability to adapt and, without noticing, become experts in interfaces that were probably misadjusted to begin with. This adaptation is not always at the user's reach. One neglected group is the blind. Spatial ability, memory, and tactile sensitivity are some characteristics that diverge between users. Regardless, all are presented with the same methods ignoring their capabilities and needs. Interaction with mobile devices is highly visually demanding which widens the gap between blind people. Our research goal is to identify the individual attributes that influence mobile interaction, considering the blind, and match them with mobile interaction modalities in a comprehensive and extensible design space. We aim to provide knowledge both for device design, device prescription and interface adaptation.

cs.HC↗

arXiv2013

Division Point Measures from Primitive Substitutions

In this note we extend results of Olli concerning limits of point measures arising from substitutions. We consider a general primitive substitution on a finite polygon set in $\mathbb{R}^2$ and show that limits of certain atomic measures each converge to Lebesgue measure.

math.DS↗

arXiv2013

Simplicity of partial skew group rings and maximal commutativity

Let R0 be a commutative associative ring (not necessarily unital), G a group and alpha a partial action by ideals that contain local units. We show that R0 is maximal commutative in the partial skew group ring R0*G if and only if R0 has the ideal intersection property in R0*G. From this we derive a criterion for simplicity of R0*G in terms of maximal commutativity and $G-$simplicity of R0 and apply this to two examples, namely to partial actions by clopen subsets of a compact set and to give a new proof of the simplicity criterion for Leavitt path algebras. A new proof of the Cuntz-Krieger uniqueness theorem for Leavitt path algebras is also provided.

math.OA↗

arXiv2013

Locally identifying coloring in bounded expansion classes of graphs

A proper vertex coloring of a graph is said to be locally identifying if the sets of colors in the closed neighborhood of any two adjacent non-twin vertices are distinct. The lid-chromatic number of a graph is the minimum number of colors used by a locally identifying vertex-coloring. In this paper, we prove that for any graph class of bounded expansion, the lid-chromatic number is bounded. Classes of bounded expansion include minor closed classes of graphs. For these latter classes, we give an alternative proof to show that the lid-chromatic number is bounded. This leads to an explicit upper bound for the lid-chromatic number of planar graphs. This answers in a positive way a question of Esperet et al [L. Esperet, S. Gravier, M. Montassier, P. Ochem and A. Parreau. Locally identifying coloring of graphs. Electronic Journal of Combinatorics, 19(2), 2012.].

math.CO↗

arXiv2013

Infinite Symmetric Matrices over Z_2 and the Lights Out Problem

We show, using a hybrid analysis/linear algebra argument, that the diagonal vector of an infinite symmetric matrix over ${\mathbb Z}_2$ is contained in the range of the matrix. We apply this result to an extension, to the countable infinite case, of the Lights Out problem.

math.CO↗

arXiv2013

Partial crossed products as equivalence relation algebras

For a free partial action of a group in a set we realize the associated partial skew group ring as an algebra of functions with finite support over an equivalence relation and we use this result to characterize the ideals in the partial skew group ring. This generalizes, to the purely algebraic setting, the known characterization of partial C*-crossed products as groupoid C*-algebras. For completeness we include a new proof of the C* result for free partial actions.

math.RA↗

arXiv2013

Simplicity of partial skew group rings of abelian groups

Let $\A$ be a ring with local units, $\E$ a set of local units for $\A$, $\G$ an abelian group and $α$ a partial action of $\G$ by ideals of $\A$ that contain local units and such that the partial skew group ring $\A\star_α \G$ is associative. We show that $\A\star_α \G$ is simple if and only if $\A$ is $\G$-simple and the center of the corner $eδ_0 (\A\star_α \G) e δ_0$ is a field for all $e\in \E$. We apply the result to characterize simplicity of partial skew group rings in two cases, namely for partial skew group rings arising from partial actions by clopen subsets of a compact set and partial actions on the set level.

math.RA↗

arXiv2013

On triangles in K_r-minor free graphs

We study graphs where each edge adjacent to a vertex of small degree (7 and 9, respectively) belongs to many triangles (4 and 5, respectively) and show that these graphs contain a complete graph (K_6 and K_7, respectively) as a minor. The second case settles a problem of Nevo (Nevo, 2007). Morevover if each edge of a graph belongs to 6 triangles then the graph contains a K_8-minor or contains K_{2,2,2,2,2} as an induced subgraph. We then show applications of these structural properties to stress freeness and coloration of graphs. In particular, motivated by Hadwiger's conjecture, we prove that every K_7-minor free graph is 8-colorable and every K_8-minor free graph is 10-colorable.

math.CO↗

arXiv2012

Toroidal maps : Schnyder woods, orthogonal surfaces and straight-line representations

A Schnyder wood is an orientation and coloring of the edges of a planar map satisfying a simple local property. We propose a generalization of Schnyder woods to graphs embedded on the torus with application to graph drawing. We prove several properties on this new object. Among all we prove that a graph embedded on the torus admits such a Schnyder wood if and only if it is an essentially 3-connected toroidal map. We show that these Schnyder woods can be used to embed the universal cover of an essentially 3-connected toroidal map on an infinite and periodic orthogonal surface. Finally we use this embedding to obtain a straight-line flat torus representation of any toroidal map in a polynomial size grid.

cs.DM↗

arXiv2012

Parameterized Domination in Circle Graphs

A circle graph is the intersection graph of a set of chords in a circle. Keil [Discrete Applied Mathematics, 42(1):51-63, 1993] proved that Dominating Set, Connected Dominating Set, and Total Dominating Set are NP-complete in circle graphs. To the best of our knowledge, nothing was known about the parameterized complexity of these problems in circle graphs. In this paper we prove the following results, which contribute in this direction: - Dominating Set, Independent Dominating Set, Connected Dominating Set, Total Dominating Set, and Acyclic Dominating Set are W[1]-hard in circle graphs, parameterized by the size of the solution. - Whereas both Connected Dominating Set and Acyclic Dominating Set are W[1]-hard in circle graphs, it turns out that Connected Acyclic Dominating Set is polynomial-time solvable in circle graphs. - If T is a given tree, deciding whether a circle graph has a dominating set isomorphic to T is NP-complete when T is in the input, and FPT when parameterized by |V(T)|. We prove that the FPT algorithm is subexponential.

cs.DS↗

arXiv2012

The Maximum Clique Problem in Multiple Interval Graphs

Multiple interval graphs are variants of interval graphs where instead of a single interval, each vertex is assigned a set of intervals on the real line. We study the complexity of the MAXIMUM CLIQUE problem in several classes of multiple interval graphs. The MAXIMUM CLIQUE problem, or the problem of finding the size of the maximum clique, is known to be NP-complete for $t$-interval graphs when $t\geq 3$ and polynomial-time solvable when $t=1$. The problem is also known to be NP-complete in $t$-track graphs when $t\geq 4$ and polynomial-time solvable when $t\leq 2$. We show that MAXIMUM CLIQUE is already NP-complete for unit 2-interval graphs and unit 3-track graphs. Further, we show that the problem is APX-complete for 2-interval graphs, 3-track graphs, unit 3-interval graphs and unit 4-track graphs. We also introduce two new classes of graphs called $t$-circular interval graphs and $t$-circular track graphs and study the complexity of the MAXIMUM CLIQUE problem in them. On the positive side, we present a polynomial time $t$-approximation algorithm for WEIGHTED MAXIMUM CLIQUE on $t$-interval graphs, improving earlier work with approximation ratio $4t$.

cs.DM↗

arXiv2012

Leavitt path algebras as partial skew group rings

We realize Leavitt path algebras as partial skew group rings and give new proofs, based on partial skew group ring theory, of the Cuntz-Krieger uniqueness theorem and simplicity criteria for Leavitt path algebras.

math.RA↗

arXiv2011

C*-algebras Associated do Stationary Ordered Bratteli Diagrams

In this paper, we introduce a C*-algebra associated to any substitution (via its Bratteli diagram model). We show that this C*-algebra contains the partial crossed product C*-algebra of the corresponding Bratteli-Vershik system and show that these algebras are invariant under equivalence of the Bratteli diagrams. We also show that the isomorphism class of the algebras, together with a distinguished set of generators, is a complete invariant for equivalence of Bratteli diagrams.

math.OA↗

arXiv2011

The tiling C*-algebra viewed as a tight inverse semigroup algebra

We realize Kellendonk'?s C*-algebra of an aperiodic tiling as the tight C*-algebra of the inverse semigroup associated to the tiling, thus providing further evidence that the tight C*-algebra is a good candidate to be the natural associative algebra to go along with an inverse semigroup.

math.OA↗

arXiv2011

The Domination Number of Grids

In this paper, we conclude the calculation of the domination number of all $n\times m$ grid graphs. Indeed, we prove Chang's conjecture saying that for every $16\le n\le m$, $γ(G_{n,m})=\lfloor\frac{(n+2)(m+2)}{5}\rfloor -4$.

cs.DM↗