Search

We have developed a reinforcement learning agent that often finds a minimal sequence of unknotting crossing changes for a knot diagram with up to 200 crossings, hence giving an upper bound on the unknotting number. We have used this to determine the unknotting number of 57k knots. We took diagrams of connected sums of such knots with oppositely signed signatures, where the summands were overlaid. The agent has found examples where several of the crossing changes in an unknotting collection of crossings result in hyperbolic knots. Based on this, we have shown that, given knots $K$ and $K'$ that satisfy some mild assumptions, there is a diagram of their connected sum and $u(K) + u(K')$ unknotting crossings such that changing any one of them results in a prime knot. As a by-product, we have obtained a dataset of 2.6 million distinct hard unknot diagrams; most of them under 35 crossings. Assuming the additivity of the unknotting number, we have determined the unknotting number of 43 at most 12-crossing knots for which the unknotting number is unknown., Comment: 29 pages, 17 figures

Digital twins in manufacturing serve as a crucial bridge between the industrial age and the digital age, offering immense value. Current additive manufacturing processes are able to generate vast amounts of in-process data, which, when effectively ingested, can be transformed into insightful decisions. Data-driven methods from reduced order modeling and system identification are particularly promising in managing this data deluge. This study focuses on Laser Powder Directed Energy Deposition (LP-DED) equipped with in-situ process measurements to develop a compact virtual test-bed. This test-bed can accurately ingest arbitrary process inputs and report in-process observables as outputs. This virtual test-bed is derived using Dynamic Mode Decomposition with Control (DMDc) and is coupled with uncertainty quantification techniques to ensure robust predictions., Comment: 22 pages, 12 figures

The Pan-STARRS 3$\pi$ survey has detected hundreds of thousands of variable stars thanks to its coverage and 4-year time span, even though the sampling of the light curves is relatively sparse. These light curves contain only 10-15 detections in each of the five filters (g,r,i,z,y). During the K2 mission, the Kepler space telescope observed with a high sampling frequency, although only for about 80 days in each of its campaigns. Crossmatching and investigating the RR Lyrae stars observed by both K2 and Pan-STARRS can serve as a valuable tool to validate the classification and period determination of the survey. We used the Sesar catalogue of RR Lyrae stars detected by Pan-STARRS. After determining the overlap, we also considered the Gaia DR3 RR Lyrae catalogue data for these stars wherever it was available. The frequencies of the light variations were calculated by applying the Lomb-Scargle periodogram method on the K2 light curves that were prepared with autoEAP photometry. The calculated frequencies of the stars then were compared with those given in the Sesar catalogue and the Gaia DR3 RR Lyrae catalogue. We found that for the majority of the stars, the classification (95.6%) and the frequency determination (90.1%) of the PanSTARRS RR Lyrae stars were consistent within 0.03 d-1 with those that we derived from the K2 autoEAP light curves. For a significant subset of the sample, 7.4%, however, an offset of 1 or 2 d-1 was found in the frequencies. These are the result of the sampling of the detections, because Pan-STARRS observations are affected by diurnal cycles, whereas Kepler carried out measurements quasicontinuously. We found that RRc subtypes are significantly more affected (25.3%) than RRab subtypes (3.7%), which is most likely caused by RRc stars having less sharp light curve features. Validation via space-based data will be important for future ground-based surveys, as well., Comment: 9 pages, 5 figures, 2 tables, 1 appendix table, accepted for publication in A&A

In this paper, we introduce a novel model for random hypergraphs based on weighted random connection models. In accordance with the standard theory for hypergraphs, this model is constructed from a bipartite graph. In our stochastic model, both vertex sets of this bipartite graph form marked Poisson point processes and the connection radius is inversely proportional to a product of suitable powers of the marks. Hence, our model is a common generalization of weighted random connection models and AB random geometric graphs. For this hypergraph model, we investigate the limit theory of a variety of graph-theoretic and topological characteristics such as higher-order degree distribution, Betti numbers of the associated Dowker complex as well as simplex counts. In particular, for the latter quantity we identify regimes of convergence to normal and to stable distribution depending on the heavy-tailedness of the weight distribution. We conclude our investigation by a simulation study and an application to the collaboration network extracted from the arXiv dataset., Comment: 29 pages. 11 figures

Despite the growing importance of the digital sector, research on economic complexity and its implications continues to rely mostly on administrative records, e.g. data on exports, patents, and employment, that fail to capture the nuances of the digital economy. In this paper we use data on the geography of programming languages used in open-source software projects to extend economic complexity ideas to the digital economy. We estimate a country's software economic complexity and show that it complements the ability of measures of complexity based on trade, patents, and research papers to account for international differences in GDP per capita, income inequality, and emissions. We also show that open-source software follows the principle of relatedness, meaning that a country's software entries and exits are explained by specialization in related programming languages. We conclude by exploring the diversification and development of countries in open-source software in the context of large language models. Together, these findings help extend economic complexity methods and their policy considerations to the digital sector.

We extend a previously successful discussion of the constrained Schr\"{o}dinger system through the Dirac--Bergmann algorithm to the case of the Dirac field. In order to follow the analogy, first we discuss the classical Dirac field as a spinorial variable, by introducing properly defined momenta and a suitably modified, factor ordered Poisson bracket. According to the Dirac--Bergmann algorithm two second class Hamiltonian constraints emerge, leading to a factor ordered Dirac bracket on the full phase space. This becomes the Poisson bracket on the reduced phase space in the canonical chart adapted to the shell. The Dirac equation is recovered both as consistency condition on the full phase space and as canonical equation on the reduced phase space. Alternatively, considering the Dirac field as odd Grassmann variable, we present the details of the Dirac--Bergmann algorithm (with either left and righ derivatives acting on Grassmann valued superfunctions and involving a different type of generalized Poisson and Dirac brackets). We propose a recipe for the canonical second quantization of all three versions of the generalized Dirac brackets, yielding the correct fundamental anticommutator., Comment: 30 pages

We investigate Fox's trapezoidal conjecture for alternating links. We show that it holds for diagrammatic Murasugi sums of special alternating links, where all sums involved have length less than three (which includes diagrammatic plumbing). It also holds for links containing a large twist region, which we call twist-concentrated. Furthermore, we show some weaker inequalities between consecutive coefficients of the Alexander polynomial of an alternating 3-braid closure, and extend this to arbitrary alternating links. We then study an extension of the trapezoidal conjecture due to Hirasawa and Murasugi, which states that the stable length of the Alexander polynomial of an alternating link can be bounded from above using the signature. We estabilish this and determine when equality holds for diagrammatic Murasugi sums of special alternating knots where each sum has length less than three, and also for twist-concentrated 3-braids. Finally, we study the behavior of the Hirasawa-Murasugi inequality under concordance., Comment: 64 pages, 56 figures

Let $F_{k,d}(n)$ be the maximal size of a set ${A}\subseteq [n]$ such that the equation \[a_1a_2\dots a_k=x^d, \; a_1

Strong local clusters help firms compete on global markets. One explanation for this is that firms benefit from locating close to their suppliers and customers. However, the emergence of global supply chains shows that physical proximity is not necessarily a prerequisite to successfully manage customer-supplier relations anymore. This raises the question when firms need to colocate in value chains and when they can coordinate over longer distances. We hypothesize that one important aspect is the extent to which supply chain partners exchange not just goods but also know-how. To test this, we build on an expanding literature that studies the drivers of industrial coagglomeration to analyze when supply chain connections lead firms to colocation. We exploit detailed micro-data for the Hungarian economy between 2015 and 2017, linking firm registries, employer-employee matched data and firm-to-firm transaction data from value-added tax records. This allows us to observe colocation, labor flows and value chain connections at the level of firms, as well as construct aggregated coagglomeration patterns, skill relatedness and input-output connections between pairs of industries. We show that supply chains are more likely to support coagglomeration when the industries involved are also skill related. That is, input-output and labor market channels reinforce each other, but supplier connections only matter for colocation when industries have similar labor requirements, suggesting that they employ similar types of know-how. We corroborate this finding by analyzing the interactions between firms, showing that supplier relations are more geographically constrained between companies that operate in skill related industries., Comment: Supplementary information included

Realistic modeling of ecological population dynamics requires spatially explicit descriptions that can take into account spatial heterogeneity as well as long-distance dispersal. Here, we present Monte Carlo simulations and numerical renormalization group results for the paradigmatic model, the contact process, in the combined presence of these factors in both one and two-dimensional systems. Our results confirm our analytic arguments stating that the density vanishes smoothly at the extinction threshold, in a way characteristic of infinite-order transitions. This extremely smooth vanishing of the global density entails an enhanced exposure of the population to extinction events. At the same time, a reverse order parameter, the local persistence displays a discontinuity characteristic of mixed-order transitions, as it approaches a non-universal critical value algebraically with an exponent $\beta_p'<1$., Comment: 8 pages, 6 figures

Generalized Pl\"ucker numbers are defined to count certain types of tangent lines of generic degree $d$ complex projective hypersurfaces. They can be computed by identifying them as coefficients of GL(2)-equivariant cohomology classes of certain invariant subspaces, the so-called coincident root strata, of the vector space of homogeneous degree $d$ complex polynomials in two variables. In an earlier paper L\'aszl\'o M. Feh\'er and the author gave a new, recursive method for calculating these classes. Using this method, we showed that -- similarly to the classical Pl\"ucker formulas counting the bitangents and flex lines of a degree $d$ plane curve -- generalized Pl\"ucker numbers are polynomials in the degree $d$. In this paper, by further analyzing our recursive formula, we determine the leading terms of all the generalized Pl\"ucker formulas., Comment: 21 pages, 6 figures; typos corrected

Urban highways are common, especially in the US, making cities more car-centric. They promise the annihilation of distance but obstruct pedestrian mobility, thus playing a key role in limiting social interactions locally. Although this limiting role is widely acknowledged in urban studies, the quantitative relationship between urban highways and social ties is barely tested. Here we define a Barrier Score that relates massive, geolocated online social network data to highways in the 50 largest US cities. At the unprecedented granularity of individual social ties, we show that urban highways are associated with decreased social connectivity. This barrier effect is especially strong for short distances and consistent with historical cases of highways that were built to purposefully disrupt or isolate Black neighborhoods. By combining spatial infrastructure with social tie data, our method adds a new dimension to demographic studies of social segregation. Our study can inform reparative planning for an evidence-based reduction of spatial inequality, and more generally, support a better integration of the social fabric in urban planning., Comment: Main text: 8 pages, 4 figures, 1 table. Supplementary Information: 11 pages, 11 figures, 5 tables

Quantified policy targets are a fundamental element of climate policy, typically characterised by domain-specific and technical language. Current methods for curating comprehensive views of global climate policy targets entail significant manual effort. At present there are few scalable methods for extracting climate targets from national laws or policies, which limits policymakers' and researchers' ability to (1) assess private and public sector alignment with global goals and (2) inform policy decisions. In this paper we present an approach for extracting mentions of climate targets from national laws and policies. We create an expert-annotated dataset identifying three categories of target ('Net Zero', 'Reduction' and 'Other' (e.g. renewable energy targets)) and train a classifier to reliably identify them in text. We investigate bias and equity impacts related to our model and identify specific years and country names as problematic features. Finally, we investigate the characteristics of the dataset produced by running this classifier on the Climate Policy Radar (CPR) dataset of global national climate laws and policies and UNFCCC submissions, highlighting the potential of automated and scalable data collection for existing climate policy databases and supporting further research. Our work represents a significant upgrade in the accessibility of these key climate policy elements for policymakers and researchers. We publish our model at https://huggingface.co/ClimatePolicyRadar/national-climate-targets and related dataset at https://huggingface.co/datasets/ClimatePolicyRadar/national-climate-targets.

Context. Identifying minerals on asteroid surfaces is difficult as space weathering modifies the minerals infrared spectra. This shouldbe better understood for proper interpretation. Aims. We simulated the space weathering effects on a meteorite and recorded the alterations of the crystalline structure, such as the change in peak positions and full width at half maximum values. Methods. We used proton irradiation to simulate the effects of solar wind on a sample of NWA 10580 CO3 chondrite meteorites. After irradiation in three gradually increased steps with 1 keV ion energy, we used infrared microscopic reflectance and diffuse reflectance infrared Fourier transform spectroscopy (DRIFTS) to identify and understand the consequences of irradiation. Results. We find negative peak shifts after the first and second irradiations at pyroxene and feldspar minerals, similarly to the literature, and this shift was attributed to Mg loss. However, after the third irradiation a positive change in values in wavenumber emerged for silicates, which could come from the distortion of SiO4 tetrahedra, resembling shock deformation. The full width at half maximum values of major bands show a positive (increasing) trend after irradiations in the case of feldspars, using IR reflection measurements. Comparing DRIFTS and reflection infrared data, the peak positions of major mineral bands were at similar wavenumbers, but differences can be observed in minor bands. Conclusions. We measured the spectral changes of meteorite minerals after high doses of proton irradiation for several minerals. We show the first of these measurements for feldspars; previous works only presented pyroxene, olivine, and phyllosilicates.

Context. Rocky planets form by the concentration of solid particles in the inner few au regions of planet-forming disks. Their chemical composition reflects the materials in the disk available in the solid phase at the time the planets were forming. Aims. We aim to constrain the structure and dust composition of the inner disk of the young star HD 144432, using an extensive set of infrared interferometric data taken by the Very Large Telescope Interferometer (VLTI), combining PIONIER, GRAVITY, and MATISSE observations. Methods. We introduced a new physical disk model, TGMdust, to image the interferometric data, and to fit the disk structure and dust composition. We also performed equilibrium condensation calculations with GGchem. Results. Our best-fit model has three disk zones with ring-like structures at 0.15, 1.3, and 4.1 au. Assuming that the dark regions in the disk at ~0.9 au and at ~3 au are gaps opened by planets, we estimate the masses of the putative gap-opening planets to be around a Jupiter mass. We find evidence for an optically thin emission ($\tau<0.4$) from the inner two disk zones ($r<4$ au) at $\lambda>3\ \mu$m. Our silicate compositional fits confirm radial mineralogy gradients. To identify the dust component responsible for the infrared continuum emission, we explore two cases for the dust composition, one with a silicate+iron mixture and the other with a silicate+carbon one. We find that the iron-rich model provides a better fit to the spectral energy distribution. Conclusions. We propose that in the warm inner regions ($r<5$ au) of typical planet-forming disks, most if not all carbon is in the gas phase, while iron and iron sulfide grains are major constituents of the solid mixture along with forsterite and enstatite. Our analysis demonstrates the need for detailed studies of the dust in inner disks with new mid-infrared instruments such as MATISSE and JWST/MIRI., Comment: 29 pages, 24 figures

Generative AI including large language models (LLMs) has recently gained significant interest in the geo-science community through its versatile task-solving capabilities including programming, arithmetic reasoning, generation of sample data, time-series forecasting, toponym recognition, or image classification. Most existing performance assessments of LLMs for spatial tasks have primarily focused on ChatGPT, whereas other chatbots received less attention. To narrow this research gap, this study conducts a zero-shot correctness evaluation for a set of 76 spatial tasks across seven task categories assigned to four prominent chatbots, i.e., ChatGPT-4, Gemini, Claude-3, and Copilot. The chatbots generally performed well on tasks related to spatial literacy, GIS theory, and interpretation of programming code and functions, but revealed weaknesses in mapping, code writing, and spatial reasoning. Furthermore, there was a significant difference in correctness of results between the four chatbots. Responses from repeated tasks assigned to each chatbot showed a high level of consistency in responses with matching rates of over 80% for most task categories in the four chatbots., Comment: Published in Transactions in GIS

The notion of "pseudocompactness" was introduced by Hewitt. The concept of relatively countably compact subspaces were explored by Marjanovic to show that a $\Psi$-space is pseudocompact. A topological space is said to be DRC (DRS) iff it possesses a dense, relatively countably compact (or relatively sequentially compact, respectively) subspace. The concept of selectively pseudocompact game Sp(X) and the selectively sequentially pseudocompact game Ssp(X) were introduced by Dorantes-Aldama and Shakhmatov. They explored the relationship between the existence of a winning strategy and a stationary winning strategy for player P in these games. In particular, they observed that there exists a stationary winning strategy in the game Sp(X) (Ssp(X)) for Player P iff $X$ is DRC (or DRS, respectively). In this paper we introduce natural weakening of the properties DRC and DRS: a space $X$ is DRCo ( DRSo) iff there is a sequence $(D_n:n \in { \omega})$ of dense subsets of $X$ such that every sequence $(d_n:n \in { \omega} )$ with $d_n \in D_n$ has an accumulation point (or contains a convergent subsequence, respectively). These properties are also equivalent to the existence of some limited knowledge winning strategy on the corresponding games $Sp(X)$ and $Ssp(X)$. Clearly, DRS implies DRC and DRSo, DRC or DRSo imply DRCo. The main part of this paper is devoted to prove that apart from these trivial implications, consistently there are no other implications between these properties., Comment: 9 pages

The primary objective of this work is to construct spaces that are "pseudocompact but not countably compact," abbreviated as PNC, while endowing them with additional properties. First, motivated by an old problem of van Douwen, we construct from CH a locally compact and locally countable first countable PNC space with countable spread. A space is deemed "densely countably compact", denoted as DCC for brevity, if it possesses a dense, countable compact subspace. Moreover, a space qualifies as "densely relatively countably compact", abbreviated as DRC, if it contains a dense subset $D$ such that every infinite subset of $D$ has an accumulation point in $X$. A countably compact space is DCC, a DCC space is DRC, and a DRC space is evidently pseudocompact. The Tychonoff plank is a DCC space but is not countably compact. A $\Psi$-space belongs to the class of DRC spaces but is not DCC. Lastly, if $p\in {\omega}^*$ is not a P-point, then $T(p)$, representing the type of $p$ in ${\omega}^*$, constitutes a pseudocompact subspace of ${\omega}^*$ that is not \DRC. When considering a topological property denoted as $Q$, we define a space $X$ as "hereditarily $Q$" if every regular closed subspace of $X$ also possesses property $Q$. The Tychonoff plank and the $\Psi$-spaces are not hereditary examples. However, the aforementioned space $T(p)$ is a hereditary example, albeit not being first countable. In this paper we want to find (first countable) examples which separates these properties hereditarily. We have obtained the following result. (1) There is a DCC space $X$ such that no $H\in RC(X)^+$ is countably compact. (2) If CH holds, then there is a DRC space $Y$ such that no $H\in RC(Y)^+$ is DCC. (3) If CH holds, then there is a first countable pseudocompact space $Z$ such that no $H\in RC(Z)^+$ is DRC., Comment: 18 pages

If $X$ is a topological space and $Y$ is any set then we call a family $\mathcal{F}$ of maps from $X$ to $Y$ nowhere constant if for every non-empty open set $U$ in $X$ there is $f \in \mathcal{F}$ with $|f[U]| > 1$, i.e. $f$ is not constant on $U$. We prove the following result that improves several earlier results in the literature. If $X$ is a topological space for which $C(X)$, the family of all continuous maps of $X$ to $\mathbb{R}$, is nowhere constant and $X$ has a $\pi$-base consisting of connected sets then $X$ is $\mathfrak{c}$-resolvable., Comment: 6 pages

We give a new method to calculate the universal cohomology classes of coincident root loci. We show a polynomial behavior of them and apply this result to prove that generalized Pl\"ucker formulas are polynomials in the degree, just as the classical Pl\"ucker formulas counting the bitangents and flexes of a degree $d$ generic plane curve. We establish an upper bound for the degrees of these polynomials, and we calculate the leading terms of those whose degrees reach this upper bound. We believe that the paper is understandable without detailed knowledge of equivariant cohomology. It may serve as a demonstration of the use of equivariant cohomology in enumerative geometry through the examples of coincident root strata. We also explain how the equivariant method can be "translated" into the traditional non-equivariant method of resolutions., Comment: 29 pages; abstract made more precise, reference added

We show that certain smooth tori with group $\mathbb{Z}$ in $S^4$ have exteriors with standard equivariant intersection forms, and so are topologically unknotted. These include the turned 1-twist-spun tori in the 4-sphere constructed by Boyle, the union of the genus one Seifert surface of Cochran and Davis that has no slice derivative with a ribbon disc, and tori with precisely four critical points whose middle level set is a 2-component link with vanishing Alexander polynomial. This gives evidence towards the conjecture that all $\mathbb{Z}$-surfaces in $S^4$ are topologically unknotted, which is open for genus one and two. It is unclear whether these tori are smoothly unknotted, except for tori with four critical points whose middle level set is a split link. The double cover of $S^4$ branched along any of these surfaces is a potentially exotic copy of $S^2 \times S^2$, and, in the case of turned twisted tori, we show they cannot be distinguished from $S^2 \times S^2$ using Seiberg-Witten invariants., Comment: 22 pages, 6 figures; to appear in Transactions of the AMS

We present a process-level Poisson-approximation result for the degree-k vertices in a high-density weighted random connection model with preferential-attachment kernel in the unit volume. Our main focus lies on the impact of the left tails of the weight distribution for which we establish general criteria based on their small-weight quantiles. To illustrate that our conditions are broadly applicable, we verify them for weight distributions with polynomial and stretched exponential left tails. The proofs rest on truncation arguments and a recently established quantitative Poisson approximation result for functionals of Poisson point processes.

We show that every infinite crowded space can be mapped onto a homogeneous space of countable weight, and that there is a homogeneous space of weight continuum that cannot be mapped onto a homogeneous space of uncountable weight strictly less than continuum.

In transverse-field Ising models, disorder in the couplings gives rise to a drastic reduction of the critical energy gap and, accordingly, to an unfavorable, slower-than-algebraic scaling of the density of defects produced when the system is driven through its quantum critical point. By applying Kibble-Zurek theory and numerical calculations, we demonstrate in the one-dimensional model that the scaling of defect density with annealing time can be made algebraic by balancing the coupling disorder with suitably chosen inhomogeneous driving fields. Depending on the tail of the coupling distribution at zero, balancing can be either perfect, leading to the well-known inverse-square law of the homogeneous system, or partial, still resulting in an algebraic decrease but with a smaller, non-universal exponent. We also study defect production during an environment-temperature quench of the open variant of the model in which the system is slowly cooled down to its quantum critical point. According to our scaling and numerical results, balanced disorder leads again to an algebraic temporal decrease of the defect density., Comment: 12 pages, 6 figures

In this paper, we investigate the potential of the age-dependent random connection model (ADRCM) with the aim of representing higher-order networks. A key contribution of our work are probabilistic limit results in large domains. More precisely, we first prove that the higher-order degree distributions have a power-law tail. Second, we establish central limit theorems for the edge counts and Betti numbers of the ADRCM in the regime where the degree distribution is light tailed. Moreover, in the heavy-tailed regime, we prove that asymptotically, the recentered and suitably rescaled edge counts converge to a stable distribution. We also propose a modification of the ADRCM in the form of a thinning procedure that enables independent adjustment of the power-law exponents for vertex and edge degrees. To apply the derived theorems to finite networks, we conduct a simulation study illustrating that the power-law degree distribution exponents approach their theoretical limits for large networks. It also indicates that in the heavy-tailed regime, the limit distribution of the recentered and suitably rescaled Betti numbers is stable. We demonstrate the practical application of the theoretical results to real-world datasets by analyzing scientific collaboration networks based on data from arXiv., Comment: 28 pages

Hart and Kunen, and independently in the recent preprint arXiv:2304.13113, R\'ios-Herrej\'on defined and studied the class $C({\omega}_1)$ of topological spaces $X$ having the property that for every neighborhood assignment $\{U(y) : y \in Y\}$ with $Y \in [X]^{\omega_1}$ there is $Z \in [Y]^{\omega_1}$ such that $$Z \subset \bigcap \{U(z) : z \in Z\}.$$ It is obvious that spaces of countable net weight, i.e. having a countable network, belong to this class. In this paper we present several independence results concerning the relationships of these and several other classes that are sandwiched between them. These clarify some of the main problems that were raised in the above preprint. In particular, we prove that the continuum hypothesis, in fact a weaker combinatorial principle called super stick, implies that every regular space in $C(\omega_1)$ has countable net weight, answering a question that was raised by Hart and Kunen., Comment: 14 pages, extended and revised version

Ultracold gases of highly magnetic lanthanide atoms have enabled the realisation of dipolar quantum droplets and supersolids. However, future studies could be limited by the achievable atom numbers and hindered by high three-body loss rates. Here we study density-dependent atom loss in an ultracold gas of ${}^{166}$Er for magnetic fields below $4\ \textrm{G}$, identifying six previously unknown features which display both a strong temperature dependence and also sensitivity to the polarisation and intensity of the light used to optically trap the atoms. This detailed knowledge of the loss landscape allows us to optimise the production of dipolar BECs with more than $2 \times 10^5$ atoms and points towards optimal strategies for the study of large-atom-number dipolar gases in the droplet and supersolid regimes., Comment: 6 pages, 4 figures

This paper explores the concept of leveraging generative AI as a mapping assistant for enhancing the efficiency of collaborative mapping. We present results of an experiment that combines multiple sources of volunteered geographic information (VGI) and large language models (LLMs). Three analysts described the content of crowdsourced Mapillary street-level photographs taken along roads in a small test area in Miami, Florida. GPT-3.5-turbo was instructed to suggest the most appropriate tagging for each road in OpenStreetMap (OSM). The study also explores the utilization of BLIP-2, a state-of-the-art multimodal pre-training method as an artificial analyst of street-level photographs in addition to human analysts. Results demonstrate two ways to effectively increase the accuracy of mapping suggestions without modifying the underlying AI models: by (1) providing a more detailed description of source photographs, and (2) combining prompt engineering with additional context (e.g. location and objects detected along a road). The first approach increases the suggestion accuracy by up to 29%, and the second one by up to 20%., Comment: Submitted to The Fourth Spatial Data Science Symposium