Search

We present a method to estimate distances to Asymptotic Giant Branch (AGB) stars in the Galaxy, using spectral energy distributions (SEDs) in the near- and mid-infrared. By assuming that a given set of source properties (initial mass, stellar temperature, composition, and evolutionary stage) will provide a typical SED shape and brightness, sources are color-matched to a distance-calibrated template and thereafter scaled to extract the distance. The method is tested by comparing the distances obtained to those estimated from Very Long Baseline Interferometry or Gaia parallax measurements, yielding a strong correlation in both cases. Additional templates are formed by constructing a source sample likely to be close to the Galactic center, and thus with a common, typical distance for calibration of the templates. These first results provide statistical distance estimates to a set of almost 15,000 Milky Way AGB stars belonging to the Bulge Asymmetries and Dynamical Evolution (BAaDE) survey, with typical distance errors of $\pm 35$%. With these statistical distances a map of the intermediate-age population of stars traced by AGBs is formed, and a clear bar structure can be discerned, consistent with the previously reported inclination angle of 30$^\circ$ to the GC-Sun direction vector. These results motivate deeper studies of the AGB population to tease out the intermediate-age stellar distribution throughout the Galaxy, as well as determining statistical properties of the AGB population luminosity and mass-loss rate distributions., Comment: Accepted to APJ

An internal or friendly partition of a vertex set $V(G)$ of a graph $G$ is a partition to two nonempty sets $A\cup B$ such that every vertex has at least as many neighbours in its own class as in the other one. Motivated by Diwan's existence proof on internal partitions of graphs with high girth, we give constructive proofs for the existence of internal partitions in the incidence graph of projective planes and discuss its geometric properties. In addition, we determine exactly the maximum possible difference between the sizes of the neighbor set in its own class and the neighbor set of the other class, that can be attained for all vertices at the same time for the incidence graphs of desarguesian planes of square order.

Let $G$ denote an Abelian group, written additively. A $3$-term arithmetic progression of $G$, $3$-$\mathrm{AP}$ for short, is a set of three distinct elements of $G$ of the form $g$, $g+d$, $g+2d$, for some $g,d \in G$. A set $S\subseteq G$ is called $3$-$\mathrm{AP}$ free if it does not contain a $3$-$\mathrm{AP}$. $S$ is called complete $3$-$\mathrm{AP}$ free if it is $3$-$\mathrm{AP}$ free and the addition of any further element would violate the $3$-$\mathrm{AP}$ free property. In case $S$ is not necessarily $3$-$\mathrm{AP}$ free but for each $x \in G \setminus S$ there is a $3$-$\mathrm{AP}$ of $G$ consisting of $x$ and two elements of $S$, we call $S$ saturating w.r.t. $3$-$\mathrm{AP}$s. A classical problem in additive combinatorics is to determine the maximal size of a $3$-$\mathrm{AP}$ free set. A classical problem in finite geometry and coding theory is to find the minimal size of a complete cap in affine spaces, where a cap is a point set without a collinear triplet and in $\mathbb{F}_3^n$ caps and $3$-$\mathrm{AP}$ free sets are the same objects. In this paper we determine the minimum size of complete $3$-$\mathrm{AP}$ free sets and $3$-$\mathrm{AP}$ saturating sets for several families of vector spaces and cyclic groups, up to a small multiplicative constant factor., Comment: Some typos are corrected, some new references are added

This research explores the reliability of deep learning, specifically Long Short-Term Memory (LSTM) networks, for estimating the Hurst parameter in fractional stochastic processes. The study focuses on three types of processes: fractional Brownian motion (fBm), fractional Ornstein-Uhlenbeck (fOU) process, and linear fractional stable motions (lfsm). The work involves a fast generation of extensive datasets for fBm and fOU to train the LSTM network on a large volume of data in a feasible time. The study analyses the accuracy of the LSTM network's Hurst parameter estimation regarding various performance measures like RMSE, MAE, MRE, and quantiles of the absolute and relative errors. It finds that LSTM outperforms the traditional statistical methods in the case of fBm and fOU processes; however, it has limited accuracy on lfsm processes. The research also delves into the implications of training length and valuation sequence length on the LSTM's performance. The methodology is applied by estimating the Hurst parameter in Li-ion battery degradation data and obtaining confidence bounds for the estimation. The study concludes that while deep learning methods show promise in parameter estimation of fractional processes, their effectiveness is contingent on the process type and the quality of training data.

Teleoperated or remote-controlled driving complements automated driving and acts as transitional technology toward full automation. An economic advantage of teleoperated driving in logistics operations lies in managing fleets with fewer teleoperators compared to vehicles with in-vehicle drivers. This alleviates growing truck driver shortage problems in the logistics industry and saves costs. However, a trade-off exists between the teleoperator-to-vehicle ratio and the service level of teleoperation. This study designs a simulation framework to explore this trade-off generating multiple performance indicators as proxies for teleoperation service level. By applying the framework, we identify factors influencing the trade-off and optimal teleoperator-to-vehicle ratios under different scenarios. Our case study on road freight tours in The Netherlands reveals that for any operational setting, a teleoperation-to-vehicle ratio below one can manage all freight truck tours without delay, while one represents the current situation. The minimum teleoperator-to-vehicle ratio for zero-delay operations is never above 0.6, implying a minimum of 40% teleoperation labor cost saving. For operations where a small delay is allowed, teleoperator-to-vehicle ratios as low as 0.4 are shown to be feasible, which indicates potential savings of up to 60%. This confirms great promise for a positive business case for the teleoperated driving as a service.

In order to reprove an old result of R\'edei's on the number of directions determined by a set of cardinality $p$ in $\mathbb{F}_p^2$, Somlai proved that the non-constant polynomials over the field $\mathbb{F}_p$ whose range sums are equal to $p$ are of degree at least $\frac{p-1}{2}$. Here we characterise all of these polynomials having degree exactly $\frac{p-1}{2}$, if $p$ is large enough. As a consequence, for the same set of primes we re-establish the characterisation of sets with few determined directions due to Lov\'asz and Schrijver using discrete Fourier analysis.

In a graph $G$, the $2$-neighborhood of a vertex set $X$ consists of all vertices of $G$ having at least $2$ neighbors in $X$. We say that a bipartite graph $G(A,B)$ satisfies the double Hall property if $|A|\geq2$, and every subset $X \subseteq A$ of size at least $2$ has a $2$-neighborhood of size at least $|X|$. Salia conjectured that any bipartite graph $G(A,B)$ satisfying the double Hall property contains a cycle covering $A$. Here, we prove the existence of a $2$-factor covering $A$ in any bipartite graph $G(A,B)$ satisfying the double Hall property. We also show Salia's conjecture for graphs with restricted degrees of vertices in $B$. Additionally, we prove a lower bound on the number of edges in a graph satisfying the double Hall property, and the bound is sharp up to a constant factor., Comment: minor corrections; to be published in Discrete Mathematics

For a positive integer r, an r-spin topological quantum field theory is a 2-dimensional TQFT with tangential structure given by the r-fold cover of SO_2 . In particular, such a TQFT assigns a scalar invariant to every closed r-spin surface Sigma. Given a sequence of scalars indexed by the set of diffeomorphism classes of all such Sigma, we construct a symmetric monoidal category C and a C-valued r-spin TQFT which reproduces the given sequence. We also determine when such a sequence arises from a TQFT valued in an abelian category with finite-dimensional Hom spaces. In particular, we construct TQFTs with values in super vector spaces that can distinguish all diffeomorphism classes of r-spin surfaces, and we show that the associated algebras are necessarily non-semisimple.

As one of the nearest and most dormant supermassive black holes (SMBHs), M31* provides a rare but promising opportunity for studying the physics of black hole accretion and feedback at the quiescent state. Previous Karl G. Jansky Very Large Array (VLA) observations with an arcsec resolution have detected M31* as a compact radio source over centimeter wavelengths, but the steep radio spectrum suggests optically-thin synchrotron radiation from an outflow driven by a hot accretion flow onto the SMBH. Aiming to probe the putative radio outflow, we have conducted milli-arcsec-resolution very long baseline interferometric (VLBI) observations of M31* in 2016, primarily at 5 GHz and combining the Very Long Baseline Array, Tianma-65m and Shanghai-25m Radio Telescopes. Despite the unprecedented simultaneous resolution and sensitivity achieved, no significant ($\gtrsim 3\sigma$) signal is detected at the putative position of M31* given an RMS level of $\rm 5.9~\mu Jy\ beam^{-1}$, thus ruling out a point-like source with a peak flux density comparable to that ($\sim30~\mu Jy\ beam^{-1}$) measured by the VLA observations taken in 2012. We disfavor the possibility that M31* has substantially faded since 2012, in view that a 2017 VLA observation successfully detected M31* at a historically-high peak flux density ($\sim75~\mu Jy\ beam^{-1}$ at 6 GHz). Instead, the non-detection of the VLBI observations is best interpreted as the arcsec-scale core being resolved out at the milli-arcsec-scale, suggesting an intrinsic size of M31* at 5 GHz larger than $\sim300$ times the Schwarzschild radius. Such extended radio emission may originate from a hot wind driven by the weakly accreting SMBH., Comment: 9 pages, 2 figures. Accepted for publication in the Astrophysical Journal

We study the set of intersection sizes of a k-dimensional affine subspace and a point set of size m \in [0, 2^n] of the n-dimensional binary affine space AG(n,2). Following the theme of Erd\H{o}s, F\"uredi, Rothschild and T. S\'os, we partially determine which local densities in k-dimensional affine subspaces are unavoidable in all $m$-element point sets in the n-dimensional affine space. We also show constructions of point sets for which the intersection sizes with $k$-dimensional affine subspaces takes values from a set of a small size compared to 2^k. These are built up from affine subspaces and so-called subspace evasive sets. Meanwhile, we improve the best known upper bounds on subspace evasive sets and apply results concerning the canonical signed-digit (CSD) representation of numbers., Comment: some typos fixed, further reference added

Revealing the structural properties and understanding the evolutionary mechanisms of the urban heavy truck mobility network (UHTMN) provide insights in assessment of freight policies to manage and regulate the urban freight system, and are of vital importance for improving the livability and sustainability of cities. Although massive urban heavy truck mobility data become available in recent years, in-depth studies on the structure and evolution of UHTMN are still lacking. Here we use massive urban heavy truck GPS data in China to construct the UHTMN and reveal its a wide range of structure properties. We further develop an evolving network model that simultaneously considers weight, space and system element duplication. Our model reproduces the observed structure properties of UHTMN and helps us understand its underlying evolutionary mechanisms. Our model also provides new perspectives for modeling the evolution of many other real-world networks, such as protein interaction networks, citation networks and air transportation networks., Comment: 18 pages, 6 figures

This paper is a follow-up to [arXiv:2001.05055] in which two-dimensional conformal field theories in the presence of spin structures are studied. In the present paper we define four types of CFTs, distinguished by whether they need a spin structure or not in order to be well-defined, and whether their fields have parity or not. The cases of spin dependence without parity, and of parity without the need of a spin structure, have not, to our knowledge, been investigated in detail so far. We analyse these theories by extending the description of CFT correlators via three-dimensional topological field theory developed in [arXiv:hep-th/0204148] to include parity and spin. In each of the four cases, the defining data are a special Frobenius algebra $F$ in a suitable ribbon fusion category, such that the Nakayama automorphism of $F$ is the identity (oriented case) or squares to the identity (spin case). We use the TFT to define correlators in terms of $F$ and we show that these satisfy the relevant factorisation and single-valuedness conditions. We allow for world sheets with boundaries and topological line defects, and we specify the categories of boundary labels and the fusion categories of line defect labels for each of the four types. The construction can be understood in terms of topological line defects as gauging a possibly non-invertible symmetry. We analyse the case of a $\mathbb{Z}_2$-symmetry in some detail and provide examples of all four types of CFT, with Bershadsky-Polyakov models illustrating the two new types., Comment: v2 - expanded some discussions in the introduction and in the examples section - 112 pages

The classical No-Three-In-Line problem seeks the maximum number of points that may be selected from an $n\times n$ grid while avoiding a collinear triple. The maximum is well known to be linear in $n$. Following a question of Erde, we seek to select sets of large density from the infinite grid $Z^{2}$ while avoiding a collinear triple. We show the existence of such a set which contains $\Theta(n/\log^{1+\varepsilon}n)$ points in $[1,n]^{2}$ for all $n$, where $\varepsilon>0$ is an arbitrarily small real number. We also give computational evidence suggesting that a set of lattice points may exist that has at least $n/2$ points on every large enough $n\times n$ grid., Comment: 12 pages, 3 figures

In this paper we continue the study of a natural generalization of Tur\'an's forbidden subgraph problem and the Ruzsa-Szemer\'edi problem. Let $ex_F(n,G)$ denote the maximum number of edge-disjoint copies of a fixed simple graph $F$ that can be placed on an $n$-vertex ground set without forming a subgraph $G$ whose edges are from different $F$-copies. The case when both $F$ and $G$ are triangles essentially gives back the theorem of Ruzsa and Szemer\'edi. We extend their results to the case when $F$ and $G$ are arbitrary cliques by applying a number theoretic result due to Erd\H{o}s, Frankl and R\"odl. This extension in turn decides the order of magnitude for a large family of graph pairs, which will be subquadratic, but almost quadratic. Since the linear $r$-uniform hypergraph Tur\'an problems to determine $ex_r^{lin}(n,G)$ form a class of the multicolor Tur\'an problem, following the identity $ex_r^{lin}(n,G)=ex_{K_r}(n,G)$, our results determine the linear hypergraph Tur\'an numbers of every graph of girth $3$ and for every $r$ up to a subpolynomial factor. Furthermore, when $G$ is a triangle, we settle the case $F=C_5$ and give bounds for the cases $F=C_{2k+1}$, $k\ge 3$ as well.

The music streaming service Deezer extensively relies on its Flow algorithm, which generates personalized radio-style playlists of songs, to help users discover musical content. Nonetheless, despite promising results over the past years, Flow used to ignore the moods of users when providing recommendations. In this paper, we present Flow Moods, an improved version of Flow that addresses this limitation. Flow Moods leverages collaborative filtering, audio content analysis, and mood annotations from professional music curators to generate personalized mood-specific playlists at scale. We detail the motivations, the development, and the deployment of this system on Deezer. Since its release in 2021, Flow Moods has been recommending music by moods to millions of users every day., Comment: 16th ACM Conference on Recommender Systems (RecSys 2022) - Industry paper

In distributed computing, a Byzantine fault is a condition where a component behaves inconsistently, showing different symptoms to different components of the system. Consensus among the correct components can be reached by appropriately crafted communication protocols even in the presence of byzantine faults. Quantum-aided protocols built upon distributed entangled quantum states are worth considering, as they are more resilient than traditional ones. Based on earlier ideas, here we establish a parameter-dependent family of quantum-aided weak broadcast protocols. We compute upper bounds on the failure probability of the protocol, and define and illustrate a procedure that minimizes the quantum resource requirements. Following earlier work demonstrating the suitability of noisy intermediate scale quantum (NISQ) devices for the study of quantum networks, we experimentally create our resource quantum state on publicly available quantum computers. Our work highlights important engineering aspects of the future deployment of quantum communication protocols with multi-qubit entangled states., Comment: 11 pages main text, 16 pages appendix, 12 figures, 3 tables

We consider a natural generalisation of Tur\'an's forbidden subgraph problem and the Ruzsa-Szemer\'edi problem by studying the maximum number $ex_F(n,G)$ of edge-disjoint copies of a fixed graph $F$ can be placed on an $n$-vertex ground set without forming a subgraph $G$ whose edges are from different $F$-copies. We determine the pairs $\{F, G\}$ for which the order of magnitude of $ex_F(n,G)$ is quadratic and prove several asymptotic results using various tools from the regularity lemma and supersaturation to graph packing results.

An internal or friendly partition of a graph is a partition of the vertex set into two nonempty sets so that every vertex has at least as many neighbours in its own class as in the other one. It has been shown that apart from finitely many counterexamples, every 3, 4 or 6-regular graph has an internal partition. In this note we focus on the $5$-regular case and show that among the subgraphs of minimum degree at least $3$, there are some which have small intersection. We also discuss the existence of internal partitions in some families of Cayley graphs, notably we determine all $5$-regular Abelian Cayley graphs which do not have an internal partition.

We prove the $r$-spin cobordism hypothesis in the setting of (weak) 2-categories for every positive integer $r$: The 2-groupoid of 2-dimensional fully extended $r$-spin TQFTs with given target is equivalent to the homotopy fixed points of an induced $\textrm{Spin}_2^r$-action. In particular, such TQFTs are classified by fully dualisable objects together with a trivialisation of the $r$-th power of their Serre automorphisms. For $r=1$ we recover the oriented case (on which our proof builds), while ordinary spin structures correspond to $r=2$. To construct examples, we explicitly describe $\textrm{Spin}_2^r$-homotopy fixed points in the equivariant completion of any symmetric monoidal 2-category. We also show that every object in a 2-category of Landau--Ginzburg models gives rise to fully extended spin TQFTs, and that half of these do not factor through the oriented bordism 2-category., Comment: 64 pages; v2: minor changes, Proposition 3.2 assumes a pivotal structure