1,720,968 research outputs found
Algebraic entropy on topologically quasihamiltonian groups
No full textWe study the algebraic entropy of continuous endomorphisms of compactly covered, locally compact, topologically quasihamiltonian groups. We provide a Limit-free formula which helps us to simplify the computations of this entropy. Moreover, several Addition Theorems are given. In particular, we prove that the Addition Theorem holds for every group endomorphism of a quasihamiltonian torsion FC-group (e.g., a Hamiltonian group)
Groups with cofinite Zariski topology and potential density
No full textTkachenko and Yaschenko [33] characterized the abelian groups G such that all proper unconditionally closed subsets of G are finite, these are precisely the abelian groups G having cofinite Zariski topology (they proved that such a G is either almost torsion-free or of prime exponent). Furthermore, the authors connected this fact to Markov's notion of potential density and the existence of pairs of independent group topologies. Inspired by their work, we examine the class C of groups having cofinite Zariski topology in the general case, obtaining a number of very strong restrictions on these groups in the non-abelian case which suggest the bold conjecture that a group with cofinite Zariski topology is necessarily either abelian or finite. We show that Tkachenko–Yaschenko theorem fails in the non-abelian case and we offer a natural counterpart in the general case using a partial Zariski topology and an appropriate stronger version of the property almost torsion-free
Coarse-graining Complex Networks for Control Equivalence
No full textThe ability to control complex networks is of crucial importance across a wide range of applications in natural and engineering sciences. However, issues of both theoretical and numerical nature introduce fundamental limitations to controlling large-scale networks. In this paper, we cope with this problem by introducing a coarse-graining algorithm. It leads to an aggregated network which satisfies control equivalence, i.e., such that the optimal control values for the original network can be exactly recovered from those of the aggregated one. The algorithm is based on a partition refinement method originally devised for systems of ordinary differential equations, here extended and applied to linear dynamics on complex networks. Using a number of benchmarks from the literature we show considerable reductions across a variety of networks from biology, ecology, engineering, and social sciences
Some applications of algebraic entropy to the proof of Milnor-Wolf theorem
Full text linkWe discuss the growth function of a finitely generated cascade and its
connection to the growth function of its related semi-direct product
(Conjecture 1.9). The results is applied for simpler proof of well-known
results in the realm of geometric group theory. We show that the finitely
generated cascades on nilpotent groups obey the dichotomy rule (only
polynomial and exponential growth are possible)
Going Beyond Counting First Authors in Author Co-citation Analysis
Full text linkThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Variations on the Author
Full text link“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
- …
