arXiv subjects

Daniele Toller

Publications and source records attributed to Daniele Toller.

12 recordsLinked to original sources

arXiv2026

Computing Fixed Points using Dependency Oracles

We present global and local algorithms for solving systems of equations over Noetherian posets with a bottom element, a general setting underlying many verification problems. Our algorithms compute the solution of a selected variable by restricting exploration to those parts of the system required to determine its value. We achieve this by computing variable dependencies by means of dependency oracles. Oracles guide the exploration of the system and provide sound termination criteria for local fixed-point computation. A key advantage of our approach is its flexibility: oracles can be customized, composed, or over-approximated, offering a principled way to trade precision for performance without compromising correctness. We evaluate our solution against existing algorithms from the literature and show that our prototype implementation is competitive and often outperforms specialized solutions, while remaining simple and adaptable across diverse application domains.

cs.LO↗

arXiv2023

Proper Lumping for Positive Bilinear Control Systems

Positive systems naturally arise in situations where the model tracks physical quantities. Although the linear case is well understood, analysis and controller design for nonlinear positive systems remain challenging. Model reduction methods can help tame this problem. Here we propose a notion of model reduction for a class of positive bilinear systems with (bounded) matrix and exogenous controls. Our reduction, called proper positive lumping, aggregates the original system such that states of the corresponding reduced model represent non-negative linear combinations of original state variables. We prove a characterization result showing that the reductions by proper positive lumping are exactly those preserving the optimality of a suitable class of value functions. Moreover, we provide an efficient polynomial-time algorithm for the computation of the minimal lumping. We numerically evaluate our approach by applying it to a number of benchmark case studies.

math.OC↗

arXiv2023

Coarse-graining Complex Networks for Control Equivalence

The 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.

eess.SY↗

arXiv2023

The algebraic entropy of one-dimensional finitary linear cellular automata

The aim of this paper is to present one-dimensional finitary linear cellular automata $S$ on $\mathbb Z_m$ from an algebraic point of view. Among various other results, we: (i) show that the Pontryagin dual $\widehat S$ of $S$ is a classical one-dimensional linear cellular automaton $T$ on $\mathbb Z_m$; (ii) give several equivalent conditions for $S$ to be invertible with inverse a finitary linear cellular automaton; (iii) compute the algebraic entropy of $S$, which coincides with the topological entropy of $T=\widehat S$ by the so-called Bridge Theorem. In order to better understand and describe the entropy we introduce the degree $\mathrm{deg}(S)$ and $\mathrm{deg}(T)$ of $S$ and $T$.

math.GR↗

arXiv2023

Optimality-preserving Reduction of Chemical Reaction Networks

Across many disciplines, chemical reaction networks (CRNs) are an established population model defined as a system of coupled nonlinear ordinary differential equations. In many applications, for example, in systems biology and epidemiology, CRN parameters such as the kinetic reaction rates can be used as control inputs to steer the system toward a given target. Unfortunately, the resulting optimal control problem is nonlinear, therefore, computationally very challenging. We address this issue by introducing an optimality-preserving reduction algorithm for CRNs. The algorithm partitions the original state variables into a reduced set of macro-variables for which one can define a reduced optimal control problem from which one can exactly recover the solution of the original control problem. Notably, the reduction algorithm runs with polynomial time complexity in the size of the CRN. We use this result to reduce reachability and control problems of large-scale protein-interaction networks and vaccination models with hundreds of thousands of state variables.

eess.SY↗

arXiv2021

Groups with cofinite Zariski topology and potential density

Tkachenko and Yaschenko [34] 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). 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.

math.GR↗

arXiv2020

Intrinsic entropy for generalized quasimetric semilattices

We introduce the notion of intrinsic semilattice entropy $\widetilde h$ in the category $\mathcal L_{qm}$ of generalized quasimetric semilattices and contractive homomorphisms. By using appropriate categories $\mathfrak X$ and functors $F:\mathfrak X\to\mathcal L_{qm}$ we find specific known entropies $\widetilde h_\mathfrak X$ on $\mathfrak X$ as intrinsic functorial entropies, that is, as $\widetilde h_\mathfrak X=\widetilde h\circ F$. These entropies are the intrinsic algebraic entropy, the algebraic and the topological entropies for locally linearly compact vector spaces, the topological entropy for locally compact totally disconnected groups and the algebraic entropy for locally compact compactly covered abelian groups.

math.GR↗

arXiv2019

ERRATA CORRIGE: Intrinsic algebraic entropy

The notion of intrinsic algebraic entropy of an endomorphism of a given Abelian group has been recently introduced in [D. Dikranjan, A. Giordano Bruno, L. Salce, S. Virili, Intrinsic algebraic entropy, J. Pure Appl. Algebra 219 (2015) 2933-2961]. In this short note we provide a correct argument to prove one of the basic properties of the intrinsic algebraic entropy: the Logarithmic Law. In fact, this property was correctly stated in [op. cit.] but, as we will show with an explicit counterexample, the original proof contains a flaw.

math.GR↗

arXiv2019

Algebraic entropy on topologically quasihamiltonian groups

We 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 endomorphisms of quasihamiltonian torsion FC-groups (e.g., Hamiltonian groups).

math.DS↗

arXiv2018

Densely locally minimal groups

We study locally compact groups having all dense subgroups (locally) minimal. We call such groups densely (locally) minimal. In 1972 Prodanov proved that the infinite compact abelian groups having all subgroups minimal are precisely the groups $\mathbb Z_p$ of $p$-adic integers. In [31], we extended Prodanov's theorem to the non-abelian case at several levels. In this paper, we focus on the densely (locally) minimal abelian groups. We prove that in case that a topological abelian group $G$ is either compact or connected locally compact, then $G$ is densely locally minimal if and only if $G$ either is a Lie group or has an open subgroup isomorphic to $\mathbb Z_p$ for some prime $p$. This should be compared with the main result of [9]. Our Theorem C provides another extension of Prodanov's theorem: an infinite locally compact group is densely minimal if and only if it is isomorphic to $\mathbb Z_p$. In contrast, we show that there exists a densely minimal, compact, two-step nilpotent group that neither is a Lie group nor it has an open subgroup isomorphic to $\mathbb Z_p$.

math.GN↗

arXiv2018

Algebraic entropy on strongly compactly covered groups

We introduce a new class of locally compact groups, namely the strongly compactly covered groups, which are the Hausdorff topological groups $G$ such that every element of $G$ is contained in a compact open normal subgroup of $G$. For continuous endomorphisms $ϕ:G\to G$ of these groups we compute the algebraic entropy and study its properties. Also an Addition Theorem is available under suitable conditions.

math.GN↗

arXiv2018

Hereditarily minimal topological groups

We study locally compact groups having all subgroups minimal. We call such groups hereditarily minimal. In 1972 Prodanov proved that the infinite hereditarily minimal compact abelian groups are precisely the groups $\mathbb Z_p$ of $p$-adic integers. We extend Prodanov's theorem to the non-abelian case at several levels. For infinite hypercentral (in particular, nilpotent) locally compact groups we show that the hereditarily minimal ones remain the same as in the abelian case. On the other hand, we classify completely the locally compact solvable hereditarily minimal groups, showing that in particular they are always compact and metabelian. The proofs involve the (hereditarily) locally minimal groups, introduced similarly. In particular, we prove a conjecture by He, Xiao and the first two authors, showing that the group $\mathbb Q_p\rtimes \mathbb Q_p^*$ is hereditarily locally minimal, where $\mathbb Q_p^*$ is the multiplicative group of non-zero $p$-adic numbers acting on the first component by multiplication. Furthermore, it turns out that the locally compact solvable hereditarily minimal groups are closely related to this group.

math.GN↗