arXiv subjects

Andrea Marino

Publications and source records attributed to Andrea Marino.

At least 19 recordsLinked to original sources

arXiv2026

Revisiting the Sparse Matrix Compression Problem

The sparse matrix compression problem asks for a one-dimensional representation of a binary $n \times \ell$ matrix, formed by an integer array of row indices and a shift function for each row, such that accessing a matrix entry is possible in constant time by consulting this representation. It has been shown that the decision problem for finding an integer array of length $\ell+ρ$ or restricting the shift function up to values of $ρ$ is NP-complete (cf. the textbook of Garey and Johnson). As a practical heuristic, a greedy algorithm has been proposed to shift the $i$-th row until it forms a solution with its predecessor rows. Despite that this greedy algorithm is cherished for its good approximation in practice, we show that it actually exhibits an approximation ratio of $Θ(\sqrt{\ell+ρ})$. We give further hardness results for parameterizations such as the number of distinct rows or the maximum number of non-zero entries per row. Finally, we devise a DP-algorithm that solves the problem for double-logarithmic matrix widths or logarithmic widths for further restrictions. We study all these findings also under a new perspective by introducing a variant of the problem, where we wish to minimize the length of the resulting integer array by trimming the non-zero borders, which has not been studied in the literature before but has practical motivations.

cs.DS↗

arXiv2025

UTe$_2$: a narrow band superconductor

We investigate the nature of the 5$f$ electrons in the unconventional odd-parity superconductor UTe$_2$, focusing on the degree of covalency, localization versus itinerancy, and dominant electronic configuration. This is achieved using density functional theory (DFT) in combination with dynamical mean-field theory (DMFT) calculations. A key aspect of our approach is the material-specific tuning of the double-counting correction parameter, $μ_{\rm dc}$, within the DFT+DMFT part. This tuning is guided by the energy dependence of photo-ionization cross-sections in valence band photoelectron spectroscopy. The reliability of the parameters is confirmed by the accurate reproduction of the angle-resolved valence-band photoemission spectra and the U 4$f$ core-level data. The DFT+DMFT model reveals that in UTe$_2$ U 5$f^n$ configurations with n=1 to 4 contribute to the ground state, with the 5$f^2$ configuration being most prevalent and an average 5$f$ shell fillings close to 2.5. The model further suggests that the 5$f$ electrons form narrow bands and that charge fluctuations due to degeneracy play a role in addition to coherent valence dynamics arising from hybridization with the conduction bath. Additionally, the significance of the U 6$d$ states in UTe$_2$ is discussed.

cond-mat.str-el↗

arXiv2025

Menger's Theorem for Temporal Paths (Not Walks)

A (directed) temporal graph is a (directed) graph whose edges are available only at specific times during its (discretized) lifetime $τ$. In this setting, we ask that walks respect the temporal aspect by defining $\textit{temporal walks}$ as sequences of adjacent edges whose appearing times are either strictly increasing or non-decreasing (here called non-strict), depending on the scenario. The notion of disjointness between walks is also not unique: two walks are $\textit{vertex-disjoint}$ if they do not share a vertex, and are $\textit{temporal vertex-disjoint}$ if they do not share a vertex at the same time. Thus a $\textit{temporal path}$ is a temporal walk where no repetition of vertices, at any time, is allowed. This is an important distinction that separates the interpretation of our results from those of previous works on the topic. In this paper we focus on various questions regarding connectivity (maximum number of disjoint paths) and robustness (minimum size of a cut) between a given pair of vertices. Such problems are related to the well-known Menger's Theorem on static graphs. We explore all possible interpretations of such problems, according to vertex and temporal vertex-disjointness, strict and non-strict temporal paths, and directed and undirected temporal graphs. We present a number of new results, the main of which states that Menger's Theorem holds when the maximum number of temporal vertex-disjoint temporal paths is equal to 1.

cs.DM↗

arXiv2025

A Fox-Neuwirth Basis for the Sinha Spectral Sequence

Recently, Sinha defined a spectral sequence approximating the (co)homology of the space of long knots in R^m modulo immersions, stemming from a cosimplicial structure on the compactified configuration spaces à la Kontsevich. We provide an equivalent cosimplicial structure on (the barycentric subdivision of) a regular CW complex with cells indexed by Fox-Neuwirth trees. As a corollary, we give a combinatorial presentation of the Sinha Spectral Sequence in terms of Fox-Neuwirth trees for all dimensions m>=2 and all coefficients.

math.AT↗

arXiv2025

Non collapse of the Sinha spectral sequence for knots in R^3

We give an explicit description up to the third page of the Sinha homology mod 2 spectral sequence for the space of long knots in $\mathbb{R}^3$, that is conjecturally equivalent to the Vassiliev spectral sequence. The description arises from a multicomplex structure on the Fox Neuwirth chain complexes for euclidean configuration spaces. A computer assisted calculation reveals a non trivial third page differential from a 2-dimensional class, in contrast to the rational case.

math.AT↗

arXiv2025

Matching and Edge Cover in Temporal Graphs

Temporal graphs are a special class of graphs for which a temporal component is added to edges, that is, each edge possesses a set of times at which it is available and can be traversed. Many classical problems on graphs can be translated to temporal graphs, and the results may differ. In this paper, we define the Temporal Edge Cover and Temporal Matching problems and show that they are NP-complete even when fixing the lifetime or when the underlying graph is a tree. We then describe two FPT algorithms, with parameters lifetime and treewidth, that solve the two problems. We also find lower bounds for the approximation of the two problems and give two approximation algorithms which match these bounds. Finally, we discuss the differences between the problems in the temporal and the static framework.

cs.DS↗

arXiv2025

Temporal Cycle Detection and Acyclic Temporization

In directed graphs, a cycle can be seen as a structure that allows its vertices to loop back to themselves, or as a structure that allows pairs of vertices to reach each other through distinct paths. We extend these concepts to temporal graph theory, resulting in multiple interesting definitions of a "temporal cycle". For each of these, we consider the problems of Cycle Detection and Acyclic Temporization. For the former, we are given an input temporal digraph, and we want to decide whether it contains a temporal cycle. Regarding the latter, for a given input (static) digraph, we want to time the arcs such that no temporal cycle exists in the resulting temporal digraph. We're also interested in Acyclic Temporization where we bound the lifetime of the resulting temporal digraph. Multiple results are presented, including polynomial and fixed-parameter tractable search algorithms, polynomial-time reductions from 3-SAT and Not All Equal 3-SAT, and temporizations resulting from arbitrary vertex orderings which cover (almost) all cases.

cs.CC↗

arXiv2024

Quantifying the U $5f$ covalence and degree of localization in U intermetallics

A procedure for quantifying the U $5f$ electrons' covalence and degree of localization in U intermetallic compounds is presented. To this end, bulk sensitive hard and soft x-ray photoelectron spectroscopy were utilized in combination with density-functional theory (DFT) plus dynamical mean-field theory (DMFT) calculations. The energy dependence of the photoionization cross-sections allows the disentanglement of the U\,$5f$ contribution to the valence band from the various other atomic subshells so that the computational parameters in the DFT\,+\,DMFT can be reliably determined. Applying this method to UGa$_2$ and UB$_2$ as model compounds from opposite ends of the (de)localization range, we have achieved excellent simulations of the valence band and core-level spectra. The width in the distribution of atomic U\,$5f$ configurations contributing to the ground state, as obtained from the calculations, quantifies the correlated nature and degree of localization of the U\,5$f$. The findings permit answering the longstanding question why different spectroscopic techniques give seemingly different numbers for the U 5$f$ valence in intermetallic U compounds.

cond-mat.str-el↗

arXiv2024

Stabilization of U 5$f^2$ configuration in UTe$_2$ through U 6d dimers in the presence of Te2 chains

We investigate the topological superconductor candidate UTe$_2$ using high-resolution valence-band resonant inelastic x-ray scattering at the U $M_{4,5}$-edges. We observe atomic-like low-energy excitations that support the correlated nature of this unconventional superconductor. These excitations originate from the U $5f^2$ configuration, which is unexpected since the short Te2-Te2 distances exclude Te2 being 2-. By utilizing the photoionization cross-section dependence of the photoemission spectra in combination with band structure calculations, we infer that the stabilization of the U $5f^2$ configuration is due to the U $6d$ bonding states in the U-dimers acting as a charge reservoir. Our results emphasize that the description of the physical properties should commence with a $5f^2$ $ansatz$.

cond-mat.str-el↗

arXiv2024

Spectroscopic evidence of Kondo-induced quasi-quartet in CeRh$_2$As$_2$

CeRh$_2$As$_2$ is a new multiphase superconductor with strong suggestions for an additional itinerant multipolar ordered phase. The modeling of the low temperature properties of this heavy fermion compound requires a quartet Ce$^{3+}$ crystal-field ground state. Here we provide the evidence for the formation of such a quartet state using x-ray spectroscopy. Core-level photoelectron and x-ray absorption spectroscopy confirm the presence of Kondo hybridization in CeRh$_2$As$_2$. The temperature dependence of the linear dichroism unambiguously reveils the impact of Kondo physics for coupling the Kramer's doublets into an effective quasi-quartet. Non-resonant inelastic x-ray scattering data find that the $|Γ_7^- \rangle$ state with its lobes along the 110 direction of the tetragonal structure ($xy$ orientation) contributes most to the multi-orbital ground state of CeRh$_2$As$_2$.

cond-mat.str-el↗

arXiv2023

On Computing Optimal Temporal Branchings and Spanning Subgraphs

In this work we extend the concept of out/in-branchings spanning the vertices of a digraph (also called directed spanning trees) to temporal graphs, which are digraphs where arcs are available only at prescribed times. While the literature has focused on minimum weight/earliest arrival time Temporal Out-Branchings (TOB), we solve the problem for other optimization criteria. In particular, we define five different types of TOBs based on the optimization of the travel duration (FT-TOB), of the departure time (LD-TOB), of the number of transfers (MT-TOB), of the total waiting time (MW-TOB), and of the travelling time (ST-TOB). For D$\in \{$LD,MT,ST$\}$, we provide necessary and sufficient conditions for the existence of a spanning D-TOB; when it does not exist, we characterize the maximum vertex set that a D-TOB can span. Moreover, we provide a log linear algorithm for computing such branchings. For D$\in \{$FT,MW$\}$, we prove that deciding the existence of a spanning D-TOB is NP-complete; we also show that the same results hold for optimal temporal in-branchings. Finally, we investigate the related problem of computing a spanning temporal subgraph with the minimum number of arcs and optimizing a chosen criterion D. This problem turns out to be NP-hard for any D. The hardness results are quite surprising, as computing optimal paths between nodes can always be done in polynomial time.

cs.DS↗

arXiv2023

Fe substitution in URu$_2$Si$_2$: singlet magnetism in an extended Doniach phase diagram

The application of pressure as well as the successive substitution of Ru with Fe in the hidden order (HO) compound URu$_2$Si$_2$ leads to the formation of the large moment antiferromagnetic phase (LMAFM). Here we have investigated the substitution series URu$_{2-x}$Fe$_x$Si$_2$ from $x$\,=\,0.0 to 2.0 by U\,4$f$ core-level photoelectron spectroscopy and have observed non-monotonic changes in the spectra. The initial increase and subsequent decrease of the spectral weight of the 4$f$ core level satellite with increasing $x$ stands for a non-monotonic 5$f$ filling across the substitution series. The competition of chemical pressure and increase of the density of states at the Fermi energy, both due to substitution of Ru with Fe, can explain such a behavior. An extended Doniach phase diagram including the $x$ dependence of the density of states is proposed. Also in URu$_{2-x}$Fe$_x$Si$_2$ the ground state is a singlet or quasi-doublet state consisting of two singlets. Hence, the formation of magnetic order in the URu$_{2-x}$Fe$_x$Si$_2$ substitution series must be explained within a singlet magnetism model.

cond-mat.str-el↗

arXiv2023

Singlet magnetism in intermetallic UGa$_2$ unveiled by inelastic x-ray scattering

Using high resolution tender-x-ray resonant inelastic scattering and hard-x-ray non-resonant inelastic scattering beyond the dipole limit we were able to detect electronic excitations in intermetallic UGa$_2$ that are highly atomic in nature. Analysis of the spectral lineshape reveals that the local $5f^2$ configuration characterizes the correlated nature of this ferromagnet. The orientation and directional dependence of the spectra indicate that the ground state is made of the $Γ_1$ singlet and/or $Γ_6$ doublet symmetry. With the ordered moment in the $ab$ plane, we infer that the magnetism originates from the higher lying $Γ_6$ doublet being mixed with the $Γ_1$ singlet due to inter-site exchange, qualifying UGa$_2$ to be a true quantum magnet. The ability to observe atomic excitations is crucial to resolve the on-going debate about the degree of localization versus itineracy in U intermetallics.

cond-mat.str-el↗

arXiv2023

Orbital selective coupling in CeRh$_3$B$_2$: co-existence of high Curie and high Kondo temperature

We investigated the electronic structure of the enigmatic CeRh$_3$B$_2$ using resonant inelastic scattering and x-ray absorption spectroscopy in combination with $ab$ $initio$ density functional calculations. We find that the Rh 4$d$ states are irrelevant for the high-temperature ferromagnetism and the Kondo effect. We also find that the Ce 4$f$ crystal-field strength is too small to explain the strong reduction of the Ce magnetic moment. The data reveal instead the presence of two different active Ce 4$f$ orbitals, with each coupling selectively to different bands in CeRh$_3$B$_2$. The inter-site hybridization of the |J=5/2,Jz=+/-1/2> crystal-field state and Ce 5$d$ band combined with the intra-site Ce 4$f$-5$d$ exchange creates the strong ferromagnetism, while hybridization between the |J=5/2,Jz=+/-5/2> and the B $sp$ in the $ab$-plane contributes to the Kondo interaction which causes the moment reduction. This orbital selective coupling explains the unique and seemingly contradictory properties of CeRh$_3$B$_2$.

cond-mat.str-el↗

arXiv2023

On Computing Large Temporal (Unilateral) Connected Components

A temporal (directed) graph is a graph whose edges are available only at specific times during its lifetime, $τ$. Paths are sequences of adjacent edges whose appearing times are either strictly increasing or non-strictly increasingly (i.e., non-decreasing) depending on the scenario. Then, the classical concept of connected components and also of unilateral connected components in static graphs and digraphs naturally extends to the temporal setting. In this paper, we answer to the following fundamental questions in temporal graphs. (i) What is the complexity of deciding the existence of a component of size $k$, parameterized by $τ$, by $k$, and by $k+τ$? We show that this question has a different answer depending on the considered definition of component and whether the temporal graph is directed or undirected. (ii) What is the minimum running time required to check whether a subset of vertices are pairwise reachable? A quadratic algorithm is known but, contrary to the static case, we show that a better running time is unlikely unless SETH fails. (iii) Is it possible to verify whether a subset of vertices is a component in polynomial time? We show that depending on the definition of temporal component this test is NP-complete.

math.CO↗

arXiv2022

Quantitative investigation of the 4$f$ occupation in the quasikagome Kondo lattice CeRh$_{1-x}$Pd$_x$Sn

CeRhSn with the Ce atoms forming a quasikagome lattice in the hexagonal plane has recently been discussed in the context of quantum criticality driven by magnetic frustration. Furthermore, it has been reported that the successive substitution of Rh by Pd leads to magnetic order. Here we have investigated the change of the 4$f$ occupation in the substitution series CeRh$_{1-x}$Pd$_x$Sn for for $x$ = 0, 0.1, 0.3, 0.5, 0.75 by means of photoelectron spectroscopy with hard x-rays (HAXPES). The quantitative analysis of the core level spectra with a combined full multiplet and configuration interaction analysis shows a smooth decrease of the 4$f^0$ contribution with rising $x$ due to an increase of the effective 4$f$ binding energy $\varepsilon_{4f}$ and the reduction of the effective hybridization $V_\text{eff}$. We further compare valence band data with the calculated partial density of states and find that the Pd 4$d$ states are about 1eV further away from the Ce 4$f$ states at the Fermi energy than the Rh 4$d$ states. In fact, the effective binding energy $\varepsilon_{4f}$ of the 4$f$ states in the configuration interaction analysis of the core level spectra decreases by the same amount.

cond-mat.str-el↗

arXiv2021

Proximity Search For Maximal Subgraph Enumeration

This paper proposes a new general technique for maximal subgraph enumeration which we call proximity search, whose aim is to design efficient enumeration algorithms for problems that could not be solved by existing frameworks. To support this claim and illustrate the technique we include output-polynomial algorithms for several problems for which output-polynomial algorithms were not known, including the enumeration of Maximal Bipartite Subgraphs, Maximal k-Degenerate Subgraphs (for bounded k), Maximal Induced Chordal Subgraphs, and Maximal Induced Trees. Using known techniques, such as reverse search, the space of all maximal solutions induces an implicit directed graph called "solution graph" or "supergraph", and solutions are enumerated by traversing it; however, nodes in this graph can have exponential out-degree, thus requiring exponential time to be spent on each solution. The novelty of proximity search is a formalization that allows us to define a better solution graph, and a technique, which we call canonical reconstruction, by which we can exploit the properties of given problems to build such graphs. This results in solution graphs whose nodes have significantly smaller (i.e., polynomial) out-degree with respect to existing approaches, but that remain strongly connected, so that all solutions can be enumerated in polynomial delay by a traversal. A drawback of this approach is the space required to keep track of visited solutions, which can be exponential: we further propose a technique to induce a parent-child relationship among solutions and achieve polynomial space when suitable conditions are met.

cs.DS↗

arXiv2021

Königsberg Sightseeing: Eulerian Walks in Temporal Graphs

An Eulerian walk (or Eulerian trail) is a walk (resp. trail) that visits every edge of a graph $G$ at least (resp. exactly) once. This notion was first discussed by Leonhard Euler while solving the famous Seven Bridges of Königsberg problem in 1736. What if Euler had to take a bus? In a temporal graph $(G,λ)$, with $λ: E(G)\to 2^{[τ]}$, an edge $e\in E(G)$ is available only at the times specified by $λ(e)\subseteq [τ]$, in the same way the connections of the public transportation network of a city or of sightseeing tours are available only at scheduled times. In this scenario, even though several translations of Eulerian trails and walks are possible in temporal terms, only a very particular variation has been exploited in the literature, specifically for infinite dynamic networks (Orlin, 1984). In this paper, we deal with temporal walks, local trails, and trails, respectively referring to edge traversal with no constraints, constrained to not repeating the same edge in a single timestamp, and constrained to never repeating the same edge throughout the entire traversal. We show that, if the edges are always available, then deciding whether $(G,λ)$ has a temporal walk or trail is polynomial, while deciding whether it has a local trail is NP-complete even if it has lifetime~2. In contrast, in the general case, solving any of these problems is NP-complete, even under very strict hypothesis.

cs.DM↗