arXiv subjects

Daniel Gonçalves

Publications and source records attributed to Daniel Gonçalves.

At least 37 records · Page 2Linked to original sources

arXiv2024

Kick the cliques

In the $K_r$-Cover problem, given a graph $G$ and an integer $k$ one has to decide if there exists a set of at most $k$ vertices whose removal destroys all $r$-cliques of $G$. In this paper we give an algorithm for $K_r$-Cover that runs in subexponential FPT time on graph classes satisfying two simple conditions related to cliques and treewidth. As an application we show that our algorithm solves $K_r$-Cover in time * $2^{O_r\left (k^{(r+1)/(r+2)}\log k \right)} \cdot n^{O_r(1)}$ in pseudo-disk graphs and map-graphs; * $2^{O_{t,r}(k^{2/3}\log k)} \cdot n^{O_r(1)}$ in $K_{t,t}$-subgraph-free string graphs; and * $2^{O_{H,r}(k^{2/3}\log k)} \cdot n^{O_r(1)}$ in $H$-minor-free graphs.

cs.DS↗

arXiv2024

Impact of Social Relationships on Peer Assessment in E-Learning

Peer assessment has been widely studied as a replacement for traditional evaluation, not only by reducing the professors' workload but mainly by benefiting students' engagement and learning. Although several works successfully validate its accuracy and fairness, more research must be done on how students' pre-existing social relationships affect the grades they give their peers in an e-learning course. We developed a Moodle plugin to provide the platform with peer assessment capabilities in forums and used it on an MSc course. The plugin curated the reviewer set for a post based on the author's relationships and included rubrics to counter the possible interpersonal effects of peer assessment. Results confirm that peer assessment is reliable and accurate for works with at least three peer assessments, although students' grades are slightly higher. The impact of social relationships is noticeable when students who do not like another peer grade their work consistently lower than students who have a positive connection. However, this has little influence on the final aggregate peer grade. Our findings show that peer assessment can replace traditional evaluation in an e-learning environment where students are familiar with each other.

cs.HC↗

arXiv2024

Contact graphs of boxes with unidirectional contacts

This paper is devoted to the study of particular geometrically defined intersection classes of graphs. Those were previously studied by Magnant and Martin, who proved that these graphs have arbitrary large chromatic number, while being triangle-free. We give several structural properties of these graphs, and we raise several questions.

cs.DM↗

arXiv2024

Ideals of étale groupoid algebras with coefficients in a sheaf with applications to topological dynamics

We prove the Effros-Hahn conjecture for groupoid algebras with coefficients in a sheaf, obtaining as a consequence a description of the ideals in skew inverse semigroup rings. We also use the description of the ideals to characterize when the groupoid algebras with coefficients in a sheaf are von Neumann regular, primitive, semiprimitive, or simple. We apply our results to the topological dynamics of actions of inverse semigroups, describing the existence of dense orbits and minimality in terms of primitivity and simplicity, respectively, of the associated algebra. Moreover, we apply our results to the usual complex groupoid algebra of continuous functions with compact support, used to build the C*-algebra associated with a groupoid, and describe criteria for its simplicity.

math.RA↗

arXiv2024

Subexponential algorithms in geometric graphs via the subquadratic grid minor property: the role of local radius

In this paper we investigate the existence of subexponential parameterized algorithms of three fundamental cycle-hitting problems in geometric graph classes. The considered problems, \textsc{Triangle Hitting} (TH), \textsc{Feedback Vertex Set} (FVS), and \textsc{Odd Cycle Transversal} (OCT) ask for the existence in a graph $G$ of a set $X$ of at most $k$ vertices such that $G-X$ is, respectively, triangle-free, acyclic, or bipartite. Such subexponential parameterized algorithms are known to exist in planar and even $H$-minor free graphs from bidimensionality theory [Demaine et al., JACM 2005], and there is a recent line of work lifting these results to geometric graph classes consisting of intersection of "fat" objects ([Grigoriev et al., FOCS 2022] and [Lokshtanov et al., SODA 2022]). In this paper we focus on "thin" objects by considering intersection graphs of segments in the plane with $d$ possible slopes ($d$-DIR graphs) and contact graphs of segments in the plane. Assuming the ETH, we rule out the existence of algorithms: - solving TH in time $2^{o(n)}$ in 2-DIR graphs; and - solving TH, FVS, and OCT in time $2^{o(\sqrt{n})}$ in $K_{2,2}$-free contact 2-DIR graphs. These results indicate that additional restrictions are necessary in order to obtain subexponential parameterized algorithms for %these problems. In this direction we provide: - a $2^{O(k^{3/4}\cdot \log k)}n^{O(1)}$-time algorithm for FVS in contact segment graphs; - a $2^{O(\sqrt d\cdot t^2 \log t\cdot k^{2/3}\log k)} n^{O(1)}$-time algorithm for TH in $K_{t,t}$-free $d$-DIR graphs; and - a $2^{O(k^{7/9}\log^{3/2}k)} n^{O(1)}$-time algorithm for TH in contact segment graphs.

cs.DS↗

arXiv2024

Centroid and algebraic properties of evolution algebras through graphs

The leitmotiv of this paper is linking algebraic properties of an evolution algebra with combinatorial properties of the (possibly several) graphs that one can associate to the algebra. We link nondegeneracy, zero annihilator, absorption property, von Neumann regularity, and primeness with suitable properties in the associated graph. In the presence of semiprimeness, the property of primeness is equivalent to any associated graph being downward directed. We also provide a description of the prime ideals in an evolution algebra and prove that certain algebraic properties, such as semiprimeness and perfection, can not be characterized in combinatorial terms. We describe the centroid of evolution algebras as constant functions along the connected components of its associated graph. The dimension of the centroid of a zero annihilator algebra $A$ agrees with the cardinal of the connected components of any possible graph associated to $A$. This is the combinatorial expression of an algebraic uniqueness property in the decomposition of $A$ as indecomposable algebras with $1$-dimensional centroid.

math.RA↗

arXiv2024

The socle of subshift algebras, with applications to subshift conjugacy

We introduce the concept of "irrational paths" for a given subshift and use it to characterize all minimal left ideals in the associated unital subshift algebra. Consequently, we characterize the socle as the sum of the ideals generated by irrational paths. Proceeding, we construct a graph such that the Leavitt path algebra of this graph is graded isomorphic to the socle. This realization allows us to show that the graded structure of the socle serves as an invariant for the conjugacy of Ott-Tomforde-Willis subshifts and for the isometric conjugacy of subshifts constructed with the product topology. Additionally, we establish that the socle of the unital subshift algebra is contained in the socle of the corresponding unital subshift C*-algebra.

math.RA↗

arXiv2024

Oriented trees in $O(k \sqrt{k})$-chromatic digraphs, a subquadratic bound for Burr's conjecture

In 1980, Burr conjectured that every directed graph with chromatic number $2k-2$ contains any oriented tree of order $k$ as a subdigraph. Burr showed that chromatic number $(k-1)^2$ suffices, which was improved in 2013 to $\frac{k^2}{2} - \frac{k}{2} + 1$ by Addario-Berry et al. We give the first subquadratic bound for Burr's conjecture, by showing that every directed graph with chromatic number $8\sqrt{\frac{2}{15}} k \sqrt{k} + O(k)$ contains any oriented tree of order $k$. Moreover, we provide improved bounds of $\sqrt{\frac{4}{3}} k \sqrt{k}+O(k)$ for arborescences, and $(b-1)(k-3)+3$ for paths on $b$ blocks, with $b\ge 2$.

math.CO↗

arXiv2024

The reduction theorem for algebras of one-sided subshifts over arbitrary alphabets

Let $R$ be a commutative unital ring, $\textsf{X}$ a subshift, and $\widetilde{\mathcal{A}}_R(\textsf{X})$ the corresponding unital subshift algebra. We establish the reduction theorem for $\widetilde{\mathcal{A}}_R(\textsf{X})$. As a consequence, we obtain a Cuntz-Krieger uniqueness theorem for $\widetilde{\mathcal{A}}_R(\textsf{X})$ and we show that $\widetilde{\mathcal{A}}_R(\textsf{X})$ is semiprimitive (resp. semiprime) whenever $R$ is a field (resp. a domain).

math.RA↗

arXiv2023

C*-Algebras of one-sided subshifts over arbitrary alphabets

We associate a C*-algebra $\widetilde{\mathcal{O}}_{\textsf{X}}$ with a subshift over an arbitrary, possibly infinite, alphabet. We show that $\widetilde{\mathcal{O}}_{\textsf{X}}$ is a full invariant for topological conjugacy of the subshifts of Ott, Tomforde, and Willis. When the alphabet is countable, we show that $\widetilde{\mathcal{O}}_{\textsf{X}}$ is an invariant for isometric conjugacy of subshifts with the product metric. For a suitable partial action associated with a subshift over a countable alphabet, we show that $\widetilde{\mathcal{O}}_{\textsf{X}}$ is also an invariant for continuous orbit equivalence. Additionally, we give a concrete way to compute the K-theory of $\widetilde{\mathcal{O}}_{\textsf{X}}$ and illustrate it with two examples.

math.OA↗

arXiv2023

KK-duality for self-similar groupoid actions on graphs

We extend Nekrashevych's $KK$-duality for $C^*$-algebras of regular, recurrent, contracting self-similar group actions to regular, contracting self-similar groupoid actions on a graph, removing the recurrence condition entirely and generalising from a finite alphabet to a finite graph. More precisely, given a regular and contracting self-similar groupoid $(G,E)$ acting faithfully on a finite directed graph $E$, we associate two $C^*$-algebras, $\mathcal{O}(G,E)$ and $\widehat{\mathcal{O}}(G,E)$, to it and prove that they are strongly Morita equivalent to the stable and unstable Ruelle C*-algebras of a Smale space arising from a Wieler solenoid of the self-similar limit space. That these algebras are Spanier-Whitehead dual in $KK$-theory follows from the general result for Ruelle algebras of irreducible Smale spaces proved by Kaminker, Putnam, and the last author.

math.KT↗

arXiv2023

Algebras of one-sided subshifts over arbitrary alphabets

We introduce two algebras associated with a subshift over an arbitrary alphabet. One is unital and the other not necessarily. We focus on the unital case and describe a conjugacy between Ott-Tomforde-Willis subshifts in terms of a homeomorphism between the Stone duals of suitable Boolean algebras, and in terms of a diagonal-preserving isomorphism of the associated unital algebras. For this, we realise the unital algebra associated with a subshift as a groupoid algebra and as a partial skew group ring.

math.RA↗

arXiv2023

The graded structure of Leavittt path algebras viewed as partial skew group rings

Let $E$ be a directed graph, $\mathbb K$ be a field, and $\mathbb F$ be the free group on the edges of $E$. In this work, we use the isomorphism between Leavitt path algebras and partial skew group rings to endow $L_{\mathbb K}(E)$ with an $\mathbb F$-gradation and study some algebraic properties of this gradation. More precisely, we show that graded cleanness, graded unit-regularity, and strong gradeness of $L_{\mathbb K}(E)$ are all equivalent.

math.RA↗

arXiv2023

Irreducible representations of one-sided subshift algebras

Given a subshift over an arbitrary alphabet, we construct a representation of the associated unital algebra. We describe a criteria for the faithfulness of this representation in terms of the existence of cycles with no exits. Subsequently, we focus on describing the irreducible components of this representation and characterize equivalence between such components. Building upon these findings, we identify the minimal left ideals of a subshift algebra associated with (what we call) line paths.

math.RA↗

arXiv2023

Shadowing for local homeomorphisms, with applications to edge shift spaces of infinite graphs

In this paper, we develop the basic theory of the shadowing property for local homeomorphisms of metric locally compact spaces, with a focus on applications to edge shift spaces connected with C*-algebra theory. For the local homeomorphism (the Deaconu-Renault system) associated with a direct graph, we completely characterize the shadowing property in terms of conditions on sets of paths. Using these results, we single out classes of graphs for which the associated system presents the shadowing property, fully characterize the shadowing property for systems associated with certain graphs, and show that the system associated with the rose of infinite petals presents the shadowing property and that the Renewal shift system does not present the shadowing property.

math.DS↗

arXiv2023

Partitioning into degenerate graphs in linear time

Let $G$ be a connected graph with maximum degree $Δ\geq 3$ distinct from $K_{Δ+ 1}$. Generalizing Brooks' Theorem, Borodin, Kostochka and Toft proved that if $p_1, \dots, p_s$ are non-negative integers such that $p_1 + \dots + p_s \geq Δ- s$, then $G$ admits a vertex partition into parts $A_1, \dots, A_s$ such that, for $1 \leq i \leq s$, $G[A_i]$ is $p_i$-degenerate. Here we show that such a partition can be performed in linear time. This generalizes previous results that treated subcases of a conjecture of Abu-Khzam, Feghali and Heggernes~\cite{abu2020partitioning}, which our result settles in full.

math.CO↗

arXiv2023

Entropy of local homeomorphisms with applications to infinite alphabet shift spaces

In this paper, we introduce topological entropy for dynamical systems generated by a single local homeomorphism (Deaconu-Renault systems). More precisely, we generalize Adler, Konheim, and McAndrew's definition of entropy via covers and Bowen's definition of entropy via separated sets. We propose a definition of factor map between Deaconu-Renault systems and show that entropy (via separated sets) always decreases under uniformly continuous factor maps. Since the variational principle does not hold in the full generality of our setting, we show that the proposed entropy via covers is a lower bound to the proposed entropy via separated sets. Finally, we compute entropy for infinite graphs (and ultragraphs) and compare it with the entropy of infinite graphs defined by Gurevich.

math.DS↗

arXiv2022

The ideal structure of partial skew groupoid rings with applications to topological dynamics and ultragraph algebras

Given a partial action $α$ of a groupoid $G$ on a ring $R$, we study the associated partial skew groupoid ring $R \rtimes_α G$, which carries a natural $G$-grading. We show that there is a one-to-one correspondence between the $G$-invariant ideals of $R$ and the graded ideals of the $G$-graded ring $R \rtimes_αG.$ We provide sufficient conditions for primeness, and necessary and sufficient conditions for simplicity of $R \rtimes_αG.$ We show that every ideal of $R \rtimes_αG$ is graded if, and only if, $α$ has the residual intersection property. Furthermore, if $α$ is induced by a topological partial action $θ$, then we prove that minimality of $θ$ is equivalent to $G$-simplicity of $R$, topological transitivity of $θ$ is equivalent to $G$-primeness of $R$, and topological freeness of $θ$ on every closed invariant subset of the underlying topological space is equivalent to $α$ having the residual intersection property. As an application, we characterize condition (K) for an ultragraph in terms of topological properties of the associated partial action and in terms of algebraic properties of the associated ultragraph algebra.

math.RA↗