SearcharxivSearch

arXiv subjects

Ana Rodrigues

Publications and source records attributed to Ana Rodrigues.

16 recordsLinked to original sources

Topological Entropy for Power-Law Unimodal Maps

In this paper we prove that the monotonicity of kneading sequences and topological entropy, a fundamental structural property of the quadratic family, extends to the class of power-law unimodal maps $f_a(x)=a-|x|^r$ for arbitrary critical exponent $r>1$. This generalization is nontrivial: the absence of polynomial structure and the presence of non-integer criticality preclude the direct use of classical arguments. Our approach adapts and extends the Milnor-Thurston framework by introducing a Thurston-type operator associated with the critical orbit and establishing a determinant identity that relates its linearization to the parameter derivative of the orbit. The main difficulty proving positivity of this determinant in the absence of algebraic structure - is resolved via a contraction argument on an associated Torelli space endowed with the Teichm\"uller metric, extending Thurston's pullback construction beyond the polynomial setting, that is to critical powers $r=2^\nu/k$, $\nu\geq 1$, $k$ odd, and finally use continuity in $r$. As a consequence, we show that the kneading sequence varies monotonically with the parameter, and hence that the topological entropy is an increasing function of $a$. Our results show that the combinatorial organization of parameter space familiar from the quadratic family persists for unimodal maps with arbitrary power-law criticality, indicating that monotonicity of entropy is a robust phenomenon beyond polynomial dynamics.

math.DS

Outpatient Appointment Scheduling Optimization with a Genetic Algorithm Approach

The optimization of complex medical appointment scheduling remains a significant operational challenge in multi-center healthcare environments, where clinical safety protocols and patient logistics must be reconciled. This study proposes and evaluates a Genetic Algorithm (GA) framework designed to automate the scheduling of multiple medical acts while adhering to rigorous inter-procedural incompatibility rules. Using a synthetic dataset encompassing 50 medical acts across four healthcare facilities, we compared two GA variants, Pre-Ordered and Unordered, against deterministic First-Come, First-Served (FCFS) and Random Choice baselines. Our results demonstrate that the GA framework achieved a 100% constraint fulfillment rate, effectively resolving temporal overlaps and clinical incompatibilities that the FCFS baseline failed to address in 60% and 40% of cases, respectively. Furthermore, the GA variants demonstrated statistically significant improvements (p < 0.001) in patient-centric metrics, achieving an Idle Time Ratio (ITR) frequently below 0.4 and reducing inter-healthcenter trips. While the GA (Ordered) variant provided a superior initial search locus, both evolutionary models converged to comparable global optima by the 100th generation. These findings suggest that transitioning from manual, human-mediated scheduling to an automated metaheuristic approach enhances clinical integrity, reduces administrative overhead, and significantly improves the patient experience by minimizing wait times and logistical burdens.

cs.NE

AIdentifyAGE Ontology for Decision Support in Forensic Dental Age Assessment

Age assessment is crucial in forensic and judicial decision-making, particularly in cases involving undocumented individuals and unaccompanied minors, where legal thresholds determine access to protection, healthcare, and judicial procedures. Dental age assessment is widely recognized as one of the most reliable biological approaches for adolescents and young adults, but current practices are challenged by methodological heterogeneity, fragmented data representation, and limited interoperability between clinical, forensic, and legal information systems. These limitations hinder transparency and reproducibility, amplified by the increasing adoption of AI- based methods. The AIdentifyAGE ontology is domain-specific and provides a standardized, semantically coherent framework, encompassing both manual and AI-assisted forensic dental age assessment workflows, and enabling traceable linkage between observations, methods, reference data, and reported outcomes. It models the complete medico-legal workflow, integrating judicial context, individual-level information, forensic examination data, dental developmental assessment methods, radiographic imaging, statistical reference studies, and AI-based estimation methods. It is being developed together with domain experts, and it builds on upper and established biomedical, dental, and machine learning ontologies, ensuring interoperability, extensibility, and compliance with FAIR principles. The AIdentifyAGE ontology is a fundamental step to enhance consistency, transparency, and explainability, establishing a robust foundation for ontology-driven decision support systems in medico-legal and judicial contexts.

cs.AI

SPELUNKER: Item Similarity Search Using Large Language Models and Custom K-Nearest Neighbors

This paper presents a hybrid system for intuitive item similarity search that combines a Large Language Model (LLM) with a custom K-Nearest Neighbors (KNN) algorithm. Unlike black-box dense vector systems, this architecture provides superior interpretability by first using an LLM to convert natural language queries into structured, attribute-based searches. This structured query then serves as input to a custom KNN algorithm with a BallTree search strategy, which uses a heterogeneous distance metric to preserve distinct data types. Our evaluation, conducted on a dataset of 500 wine reviews, demonstrates the system's effectiveness. The LLM achieved an F1-score of 0.9779 in information extraction, while also demonstrating high fidelity with a Jaro string similarity of 0.9321. When we augmented the KNN algorithm with LLM-based re-ranking, we observed a statistically significant improvement in recall (p=0.013), indicating the LLM's ability to identify and promote relevant items that align with nuanced user intent. This approach effectively bridges the gap between human language and machine-understandable item representations, offering a transparent and nuanced search capability.

cs.IR

Renormalization of Translated Cone Exchange Transformations

In this paper, we investigate a class of non-invertible piecewise isometries on the upper half-plane known as Translated Cone Exchanges. These maps include a simple interval exchange on a boundary we call the baseline. We provide a geometric construction for the first return map to a neighbourhood of the vertex of the middle cone for a large class of parameters, then we show a recurrence in the first return map tied to Diophantine properties of the parameters, and subsequently prove the infinite renormalizability of the first return map for these parameters.

math.DS

Construction of Invariant Curves for Some Piecewise Isometries

We establish conditions for the existence of a family of piecewise linear invariant curves in a two-parameter family of piecewise isometries on the upper half-plane known as Translated Cone Exchange Transformations. We show that these curves are embeddings of interval exchange transformations and give rise to layers of invariant regions. We also show the existence of a trapezoidal piecewise isometry for which the dynamics on the top and bottom edges are distinct 2-interval exchange transformations.

math.DS

Time-limited Bloom Filter

A Bloom Filter is a probabilistic data structure designed to check, rapidly and memory-efficiently, whether an element is present in a set. It has been vastly used in various computing areas and several variants, allowing deletions, dynamic sets and working with sliding windows, have surfaced over the years. When summarizing data streams, it becomes relevant to identify the more recent elements in the stream. However, most of the sliding window schemes consider the most recent items of a data stream without considering time as a factor. While this allows, e.g., storing the most recent 10000 elements, it does not easily translate into storing elements received in the last 60 seconds, unless the insertion rate is stable and known in advance. In this paper, we present the Time-limited Bloom Filter, a new BF-based approach that can save information of a given time period and correctly identify it as present when queried, while also being able to retire data when it becomes stale. The approach supports variable insertion rates while striving to keep a target false positive rate. We also make available a reference implementation of the data structure as a Redis module.

cs.DS

Expansion properties of Double Standard Maps

For the family of Double Standard Maps $f_{a,b}=2x+a+\frac{b}{\pi} \sin2\pi x \quad\pmod{1}$ we investigate the structure of the space of parameters $a$ when $b=1$ and when $b\in[0,1)$. In the first case the maps have a critical point, but for a set of parameters $E_1$ of positive Lebesgue measure there is an invariant absolutely continuous measure for $f_{a,1}$. In the second case there is an open nonempty set $E_b$ of parameters for which the map $f_{a,b}$ is expanding. We show that as $b\nearrow 1$, the set $E_b$ accumulates on many points of $E_1$ in a regular way from the measure point of view.

math.DS

Existence of non-trivial embeddings of Interval Exchange Transformations into Piecewise Isometries

We prove that almost every interval exchange transformation, with an associated translation surface of genus $g\geq 2$, can be non-trivially and isometrically embedded in a family of piecewise isometries. In particular this proves the existence of invariant curves for piecewise isometries, reminiscent of KAM curves for area preserving maps, which are not unions of circle arcs or line segments.

math.DS

Fair Measures for Countable-to-one Maps

In this paper we generalize the recently introduced concept of fair measure (M. Misiurewicz and A. Rodrigues, Counting preimages. Ergod. Th. & Dynam. Sys. 38 (2018), no. 5, 1837 -- 1856). We study transitive countable state Markov shift maps and extend our results to a particular class of interval maps, Markov and mixing interval maps. Finally, we move beyond the interval and look for fair measures for graph maps.

math.DS

On the dynamics of Translated Cone Exchange Transformations

In this paper we investigate translated cone exchange transformations, a new family of piecewise isometries and renormalize its first return map to a subset of its partition. As a consequence we show that the existence of an embedding of an interval exchange transformation into a map of this family implies the existence of infinitely many bounded invariant sets. We also prove the existence of infinitely many periodic islands, accumulating on the real line, as well as non-ergodicity of our family of maps close to the origin.

math.DS

Embeddings of interval exchange transformations into planar piecewise isometries

Although piecewise isometries (PWIs) are higher dimensional generalizations of one dimensional interval exchange transformations (IETs), their generic dynamical properties seem to be quite different. In this paper we consider embeddings of IET dynamics into PWI with a view to better understanding their similarities and differences. We derive some necessary conditions for existence of such embeddings using combinatorial, topological and measure theoretic properties of IETs. In particular, we prove that continuous embeddings of minimal $2$-IETs into orientation preserving PWIs are necessarily trivial and that any $3$-PWI has at most one non-trivially continuously embedded minimal $3$-IET with the same underlying permutation. Finally, we introduce a family of $4$-PWIs with apparent abundance of invariant nonsmooth fractal curves supporting IETs, that limit to a trivial embedding of an IET.

math.DS

Chaos in generically coupled phase oscillator networks with nonpairwise interactions

The Kuramoto-Sakaguchi system of coupled phase oscillators, where interaction between oscillators is determined by a single harmonic of phase differences of pairs of oscillators, has very simple emergent dynamics in the case of identical oscillators that are globally coupled: there is a variational structure that means the only attractors are full synchrony (in-phase) or splay phase (rotating wave/full asynchrony) oscillations and the bifurcation between these states is highly degenerate. Here we show that nonpairwise coupling - including three and four-way interactions of the oscillator phases - that appears generically at the next order in normal-form based calculations, can give rise to complex emergent dynamics in symmetric phase oscillator networks. In particular, we show that chaos can appear in the smallest possible dimension of four coupled phase oscillators for a range of parameter values.

nlin.CD

Hopf normal form with $S_N$ symmetry and reduction to systems of nonlinearly coupled phase oscillators

Coupled oscillator models where $N$ oscillators are identical and symmetrically coupled to all others with full permutation symmetry $S_N$ are found in a variety of applications. Much, but not all, work on phase descriptions of such systems consider the special case of pairwise coupling between oscillators. In this paper, we show this is restrictive - and we characterise generic multi-way interactions between oscillators that are typically present, except at the very lowest order near a Hopf bifurcation where the oscillations emerge. We examine a network of identical weakly coupled dynamical systems that are close to a supercritical Hopf bifurcation by considering two parameters, $\epsilon$ (the strength of coupling) and $\lambda$ (an unfolding parameter for the Hopf bifurcation). For small enough $\lambda>0$ there is an attractor that is the product of $N$ stable limit cycles; this persists as a normally hyperbolic invariant torus for sufficiently small $\epsilon>0$. Using equivariant normal form theory, we derive a generic normal form for a system of coupled phase oscillators with $S_N$ symmetry. For fixed $N$ and taking the limit $0<\epsilon\ll\lambda\ll 1$, we show that the attracting dynamics of the system on the torus can be well approximated by a coupled phase oscillator system that, to lowest order, is the well-known Kuramoto-Sakaguchi system of coupled oscillators. The next order of approximation genericlly includes terms with up to four interacting phases, regardless of $N$. Using a normalization that maintains nontrivial interactions in the limit $N\rightarrow \infty$, we show that the additional terms can lead to new phenomena in terms of coexistence of two-cluster states with the same phase difference but different cluster size.

math.DS

The Combinatorics of Avalanche Dynamics

We give a simple and elementary proof of the identity $$\sum_{r=1}^n\sum_{k_1,...,k_r\ge 1: \sum_{i=1}^r k_i= n} \frac {n!} {k_1!k_2!...k_r!}k_1^{k_2}...k_{r-1}^{k_r}=(n+1)^{n-1}$$ where $n\in \mathbb N$. A first application of this formula shows Cayley's theorem \cite{Caley} on the number of trees with $n+1$ vertices (in fact the formula is equivalent to Cayley's result). A second application gives the distribution of avalanche sizes, which can be deduced for general dynamical systems and also as a bilogically motivated urn model in probability. In particular, the law of avalanche sizes in Eurich et al. \cite{EHE} and Levina \cite{Levina} is closely related to this dynamical representation.

math.DS