@article{14717, abstract = {We count primitive lattices of rank d inside Zn as their covolume tends to infinity, with respect to certain parameters of such lattices. These parameters include, for example, the subspace that a lattice spans, namely its projection to the Grassmannian; its homothety class and its equivalence class modulo rescaling and rotation, often referred to as a shape. We add to a prior work of Schmidt by allowing sets in the spaces of parameters that are general enough to conclude the joint equidistribution of these parameters. In addition to the primitive d-lattices Λ themselves, we also consider their orthogonal complements in Zn⁠, A1⁠, and show that the equidistribution occurs jointly for Λ and A1⁠. Finally, our asymptotic formulas for the number of primitive lattices include an explicit bound on the error term.}, author = {Horesh, Tal and Karasik, Yakov}, issn = {1464-3847}, journal = {Quarterly Journal of Mathematics}, number = {4}, pages = {1253--1294}, publisher = {Oxford University Press}, title = {{Equidistribution of primitive lattices in ℝn}}, doi = {10.1093/qmath/haad008}, volume = {74}, year = {2023}, } @inproceedings{14718, abstract = {Binary decision diagrams (BDDs) are one of the fundamental data structures in formal methods and computer science in general. However, the performance of BDD-based algorithms greatly depends on memory latency due to the reliance on large hash tables and thus, by extension, on the speed of random memory access. This hinders the full utilisation of resources available on modern CPUs, since the absolute memory latency has not improved significantly for at least a decade. In this paper, we explore several implementation techniques that improve the performance of BDD manipulation either through enhanced memory locality or by partially eliminating random memory access. On a benchmark suite of 600+ BDDs derived from real-world applications, we demonstrate runtime that is comparable or better than parallelising the same operations on eight CPU cores. }, author = {Pastva, Samuel and Henzinger, Thomas A}, booktitle = {Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design}, isbn = {9783854480600}, location = {Ames, IA, United States}, pages = {122--131}, publisher = {TU Vienna Academic Press}, title = {{Binary decision diagrams on modern hardware}}, doi = {10.34727/2023/isbn.978-3-85448-060-0_20}, year = {2023}, } @article{14719, abstract = {Lithium–sulfur batteries are regarded as an advantageous option for meeting the growing demand for high-energy-density storage, but their commercialization relies on solving the current limitations of both sulfur cathodes and lithium metal anodes. In this scenario, the implementation of lithium sulfide (Li2S) cathodes compatible with alternative anode materials such as silicon has the potential to alleviate the safety concerns associated with lithium metal. In this direction, here, we report a sulfur cathode based on Li2S nanocrystals grown on a catalytic host consisting of CoFeP nanoparticles supported on tubular carbon nitride. Nanosized Li2S is incorporated into the host by a scalable liquid infiltration–evaporation method. Theoretical calculations and experimental results demonstrate that the CoFeP–CN composite can boost the polysulfide adsorption/conversion reaction kinetics and strongly reduce the initial overpotential activation barrier by stretching the Li–S bonds of Li2S. Besides, the ultrasmall size of the Li2S particles in the Li2S–CoFeP–CN composite cathode facilitates the initial activation. Overall, the Li2S–CoFeP–CN electrodes exhibit a low activation barrier of 2.56 V, a high initial capacity of 991 mA h gLi2S–1, and outstanding cyclability with a small fading rate of 0.029% per cycle over 800 cycles. Moreover, Si/Li2S full cells are assembled using the nanostructured Li2S–CoFeP–CN cathode and a prelithiated anode based on graphite-supported silicon nanowires. These Si/Li2S cells demonstrate high initial discharge capacities above 900 mA h gLi2S–1 and good cyclability with a capacity fading rate of 0.28% per cycle over 150 cycles.}, author = {Mollania, Hamid and Zhang, Chaoqi and Du, Ruifeng and Qi, Xueqiang and Li, Junshan and Horta, Sharona and Ibáñez, Maria and Keller, Caroline and Chenevier, Pascale and Oloomi-Buygi, Majid and Cabot, Andreu}, issn = {1944-8252}, journal = {ACS Applied Materials and Interfaces}, number = {50}, pages = {58462–58475}, publisher = {American Chemical Society}, title = {{Nanostructured Li₂S cathodes for silicon-sulfur batteries}}, doi = {10.1021/acsami.3c14072}, volume = {15}, year = {2023}, } @inproceedings{14735, abstract = {Scaling blockchain protocols to perform on par with the expected needs of Web3.0 has been proven to be a challenging task with almost a decade of research. In the forefront of the current solution is the idea of separating the execution of the updates encoded in a block from the ordering of blocks. In order to achieve this, a new class of protocols called rollups has emerged. Rollups have as input a total ordering of valid and invalid transactions and as output a new valid state-transition. If we study rollups from a distributed computing perspective, we uncover that rollups take as input the output of a Byzantine Atomic Broadcast (BAB) protocol and convert it to a State Machine Replication (SMR) protocol. BAB and SMR, however, are considered equivalent as far as distributed computing is concerned and a solution to one can easily be retrofitted to solve the other simply by adding/removing an execution step before the validation of the input. This “easy” step of retrofitting an atomic broadcast solution to implement an SMR has, however, been overlooked in practice. In this paper, we formalize the problem and show that after BAB is solved, traditional impossibility results for consensus no longer apply towards an SMR. Leveraging this we propose a distributed execution protocol that allows reduced execution and storage cost per executor (O(log2n/n)) without relaxing the network assumptions of the underlying BAB protocol and providing censorship-resistance. Finally, we propose efficient non-interactive light client constructions that leverage our efficient execution protocols and do not require any synchrony assumptions or expensive ZK-proofs.}, author = {Stefo, Christos and Xiang, Zhuolun and Kokoris Kogias, Eleftherios}, booktitle = {27th International Conference on Financial Cryptography and Data Security}, isbn = {9783031477539}, issn = {0302-9743}, location = {Bol, Brac, Croatia}, pages = {3--20}, publisher = {Springer Nature}, title = {{Executing and proving over dirty ledgers}}, doi = {10.1007/978-3-031-47754-6_1}, volume = {13950}, year = {2023}, } @inproceedings{14736, abstract = {Payment channel networks (PCNs) are a promising technology to improve the scalability of cryptocurrencies. PCNs, however, face the challenge that the frequent usage of certain routes may deplete channels in one direction, and hence prevent further transactions. In order to reap the full potential of PCNs, recharging and rebalancing mechanisms are required to provision channels, as well as an admission control logic to decide which transactions to reject in case capacity is insufficient. This paper presents a formal model of this optimisation problem. In particular, we consider an online algorithms perspective, where transactions arrive over time in an unpredictable manner. Our main contributions are competitive online algorithms which come with provable guarantees over time. We empirically evaluate our algorithms on randomly generated transactions to compare the average performance of our algorithms to our theoretical bounds. We also show how this model and approach differs from related problems in classic communication networks.}, author = {Bastankhah, Mahsa and Chatterjee, Krishnendu and Maddah-Ali, Mohammad Ali and Schmid, Stefan and Svoboda, Jakub and Yeo, Michelle X}, booktitle = {27th International Conference on Financial Cryptography and Data Security}, isbn = {9783031477539}, issn = {1611-3349}, location = {Bol, Brac, Croatia}, pages = {309--325}, publisher = {Springer Nature}, title = {{R2: Boosting liquidity in payment channel networks with online admission control}}, doi = {10.1007/978-3-031-47754-6_18}, volume = {13950}, year = {2023}, } @article{14737, abstract = {John’s fundamental theorem characterizing the largest volume ellipsoid contained in a convex body $K$ in $\mathbb{R}^{d}$ has seen several generalizations and extensions. One direction, initiated by V. Milman is to replace ellipsoids by positions (affine images) of another body $L$. Another, more recent direction is to consider logarithmically concave functions on $\mathbb{R}^{d}$ instead of convex bodies: we designate some special, radially symmetric log-concave function $g$ as the analogue of the Euclidean ball, and want to find its largest integral position under the constraint that it is pointwise below some given log-concave function $f$. We follow both directions simultaneously: we consider the functional question, and allow essentially any meaningful function to play the role of $g$ above. Our general theorems jointly extend known results in both directions. The dual problem in the setting of convex bodies asks for the smallest volume ellipsoid, called Löwner’s ellipsoid, containing $K$. We consider the analogous problem for functions: we characterize the solutions of the optimization problem of finding a smallest integral position of some log-concave function $g$ under the constraint that it is pointwise above $f$. It turns out that in the functional setting, the relationship between the John and the Löwner problems is more intricate than it is in the setting of convex bodies.}, author = {Ivanov, Grigory and Naszódi, Márton}, issn = {1687-0247}, journal = {International Mathematics Research Notices}, keywords = {General Mathematics}, number = {23}, pages = {20613--20669}, publisher = {Oxford University Press}, title = {{Functional John and Löwner conditions for pairs of log-concave functions}}, doi = {10.1093/imrn/rnad210}, volume = {2023}, year = {2023}, } @article{14739, abstract = {Attempts to incorporate topological information in supervised learning tasks have resulted in the creation of several techniques for vectorizing persistent homology barcodes. In this paper, we study thirteen such methods. Besides describing an organizational framework for these methods, we comprehensively benchmark them against three well-known classification tasks. Surprisingly, we discover that the best-performing method is a simple vectorization, which consists only of a few elementary summary statistics. Finally, we provide a convenient web application which has been designed to facilitate exploration and experimentation with various vectorization methods.}, author = {Ali, Dashti and Asaad, Aras and Jimenez, Maria-Jose and Nanda, Vidit and Paluzo-Hidalgo, Eduardo and Soriano Trigueros, Manuel}, issn = {1939-3539}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, keywords = {Applied Mathematics, Artificial Intelligence, Computational Theory and Mathematics, Computer Vision and Pattern Recognition, Software}, number = {12}, pages = {14069--14080}, publisher = {IEEE}, title = {{A survey of vectorization methods in topological data analysis}}, doi = {10.1109/tpami.2023.3308391}, volume = {45}, year = {2023}, } @article{14742, abstract = {Chromosomal rearrangements (CRs) have been known since almost the beginning of genetics. While an important role for CRs in speciation has been suggested, evidence primarily stems from theoretical and empirical studies focusing on the microevolutionary level (i.e., on taxon pairs where speciation is often incomplete). Although the role of CRs in eukaryotic speciation at a macroevolutionary level has been supported by associations between species diversity and rates of evolution of CRs across phylogenies, these findings are limited to a restricted range of CRs and taxa. Now that more broadly applicable and precise CR detection approaches have become available, we address the challenges in filling some of the conceptual and empirical gaps between micro- and macroevolutionary studies on the role of CRs in speciation. We synthesize what is known about the macroevolutionary impact of CRs and suggest new research avenues to overcome the pitfalls of previous studies to gain a more comprehensive understanding of the evolutionary significance of CRs in speciation across the tree of life.}, author = {Lucek, Kay and Giménez, Mabel D. and Joron, Mathieu and Rafajlović, Marina and Searle, Jeremy B. and Walden, Nora and Westram, Anja M and Faria, Rui}, issn = {1943-0264}, journal = {Cold Spring Harbor Perspectives in Biology}, keywords = {General Biochemistry, Genetics and Molecular Biology}, number = {11}, publisher = {Cold Spring Harbor Laboratory Press}, title = {{The impact of chromosomal rearrangements in speciation: From micro- to macroevolution}}, doi = {10.1101/cshperspect.a041447}, volume = {15}, year = {2023}, } @inproceedings{14743, abstract = {Leader-based consensus algorithms are fast and efficient under normal conditions, but lack robustness to adverse conditions due to their reliance on timeouts for liveness. We present QuePaxa, the first protocol offering state-of-the-art normal-case efficiency without depending on timeouts. QuePaxa uses a novel randomized asynchronous consensus core to tolerate adverse conditions such as denial-of-service (DoS) attacks, while a one-round-trip fast path preserves the normal-case efficiency of Multi-Paxos or Raft. By allowing simultaneous proposers without destructive interference, and using short hedging delays instead of conservative timeouts to limit redundant effort, QuePaxa permits rapid recovery after leader failure without risking costly view changes due to false timeouts. By treating leader choice and hedging delay as a multi-armed-bandit optimization, QuePaxa achieves responsiveness to prevalent conditions, and can choose the best leader even if the current one has not failed. Experiments with a prototype confirm that QuePaxa achieves normal-case LAN and WAN performance of 584k and 250k cmd/sec in throughput, respectively, comparable to Multi-Paxos. Under conditions such as DoS attacks, misconfigurations, or slow leaders that severely impact existing protocols, we find that QuePaxa remains live with median latency under 380ms in WAN experiments.}, author = {Tennage, Pasindu and Basescu, Cristina and Kokoris Kogias, Eleftherios and Syta, Ewa and Jovanovic, Philipp and Estrada-Galinanes, Vero and Ford, Bryan}, booktitle = {Proceedings of the 29th Symposium on Operating Systems Principles}, isbn = {9798400702297}, location = {Koblenz, Germany}, pages = {281--297}, publisher = {Association for Computing Machinery}, title = {{QuePaxa: Escaping the tyranny of timeouts in consensus}}, doi = {10.1145/3600006.3613150}, year = {2023}, } @article{18179, abstract = {Linnik type problems concern the distribution of projections of integral points on the unit sphere as their norm increases, and different generalizations of this phenomenon. Our work addresses a question of this type: we prove the uniform distribution of the projections of primitive Z2 points in the p-adic unit sphere, as their (real) norm tends to infinity. The proof is via counting lattice points in semi-simple S-arithmetic groups.}, author = {Guilloux, Antonin and Horesh, Tal}, issn = {2592-6616}, journal = {Publications mathématiques de Besançon - Algèbre et Théorie des nombres}, pages = {85--107}, publisher = {Presses Universitaires de Franche-Comté}, title = {{p-adic directions of primitive vectors}}, doi = {10.5802/pmb.50}, volume = {2023}, year = {2023}, } @misc{18634, abstract = {There are 4 tar.xz files with the result of the model for the paper: A 3D glacier dynamics-line plume model to estimate the frontal ablation of Hansbreen, Svalbard. }, author = {Muñoz Hermosilla, José M}, publisher = {Zenodo}, title = {{A 3D glacier dynamics-line plume model to estimate the frontal ablation of Hansbreen}}, doi = {10.5281/ZENODO.8005257}, year = {2023}, } @article{12287, abstract = {We present criteria for establishing a triangulation of a manifold. Given a manifold M, a simplicial complex A, and a map H from the underlying space of A to M, our criteria are presented in local coordinate charts for M, and ensure that H is a homeomorphism. These criteria do not require a differentiable structure, or even an explicit metric on M. No Delaunay property of A is assumed. The result provides a triangulation guarantee for algorithms that construct a simplicial complex by working in local coordinate patches. Because the criteria are easily verified in such a setting, they are expected to be of general use.}, author = {Boissonnat, Jean-Daniel and Dyer, Ramsay and Ghosh, Arijit and Wintraecken, Mathijs}, issn = {1432-0444}, journal = {Discrete & Computational Geometry}, keywords = {Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology, Theoretical Computer Science}, pages = {156--191}, publisher = {Springer Nature}, title = {{Local criteria for triangulating general manifolds}}, doi = {10.1007/s00454-022-00431-7}, volume = {69}, year = {2023}, } @article{12313, abstract = {Let P be a nontorsion point on an elliptic curve defined over a number field K and consider the sequence {Bn}n∈N of the denominators of x(nP). We prove that every term of the sequence of the Bn has a primitive divisor for n greater than an effectively computable constant that we will explicitly compute. This constant will depend only on the model defining the curve.}, author = {Verzobio, Matteo}, issn = {0030-8730}, journal = {Pacific Journal of Mathematics}, number = {2}, pages = {331--351}, publisher = {Mathematical Sciences Publishers}, title = {{Some effectivity results for primitive divisors of elliptic divisibility sequences}}, doi = {10.2140/pjm.2023.325.331}, volume = {325}, year = {2023}, } @article{12329, abstract = {In this article, we develop two independent and new approaches to model epidemic spread in a network. Contrary to the most studied models, those developed here allow for contacts with different probabilities of transmitting the disease (transmissibilities). We then examine each of these models using some mean field type approximations. The first model looks at the late-stage effects of an epidemic outbreak and allows for the computation of the probability that a given vertex was infected. This computation is based on a mean field approximation and only depends on the number of contacts and their transmissibilities. This approach shares many similarities with percolation models in networks. The second model we develop is a dynamic model which we analyze using a mean field approximation which highly reduces the dimensionality of the system. In particular, the original system which individually analyses each vertex of the network is reduced to one with as many equations as different transmissibilities. Perhaps the greatest contribution of this article is the observation that, in both these models, the existence and size of an epidemic outbreak are linked to the properties of a matrix which we call the R-matrix. This is a generalization of the basic reproduction number which more precisely characterizes the main routes of infection.}, author = {Gómez, Arturo and Oliveira, Goncalo}, issn = {2045-2322}, journal = {Scientific Reports}, publisher = {Springer Nature}, title = {{New approaches to epidemic modeling on networks}}, doi = {10.1038/s41598-022-19827-9}, volume = {13}, year = {2023}, } @article{12330, abstract = {The design and implementation of efficient concurrent data structures has seen significant attention. However, most of this work has focused on concurrent data structures providing good worst-case guarantees, although, in real workloads, objects are often accessed at different rates. Efficient distribution-adaptive data structures, such as splay-trees, are known in the sequential case; however, they often are hard to translate efficiently to the concurrent case. We investigate distribution-adaptive concurrent data structures, and propose a new design called the splay-list. At a high level, the splay-list is similar to a standard skip-list, with the key distinction that the height of each element adapts dynamically to its access rate: popular elements “move up,” whereas rarely-accessed elements decrease in height. We show that the splay-list provides order-optimal amortized complexity bounds for a subset of operations, while being amenable to efficient concurrent implementation. Experiments show that the splay-list can leverage distribution-adaptivity for performance, and can outperform the only previously-known distribution-adaptive concurrent design in certain workloads.}, author = {Aksenov, Vitalii and Alistarh, Dan-Adrian and Drozdova, Alexandra and Mohtashami, Amirkeivan}, issn = {1432-0452}, journal = {Distributed Computing}, pages = {395--418}, publisher = {Springer Nature}, title = {{The splay-list: A distribution-adaptive concurrent skip-list}}, doi = {10.1007/s00446-022-00441-x}, volume = {36}, year = {2023}, } @article{12331, abstract = {High carrier mobility is critical to improving thermoelectric performance over a broad temperature range. However, traditional doping inevitably deteriorates carrier mobility. Herein, we develop a strategy for fine tuning of defects to improve carrier mobility. To begin, n-type PbTe is created by compensating for the intrinsic Pb vacancy in bare PbTe. Excess Pb2+ reduces vacancy scattering, resulting in a high carrier mobility of ∼3400 cm2 V–1 s–1. Then, excess Ag is introduced to compensate for the remaining intrinsic Pb vacancies. We find that excess Ag exhibits a dynamic doping process with increasing temperatures, increasing both the carrier concentration and carrier mobility throughout a wide temperature range; specifically, an ultrahigh carrier mobility ∼7300 cm2 V–1 s–1 is obtained for Pb1.01Te + 0.002Ag at 300 K. Moreover, the dynamic doping-induced high carrier concentration suppresses the bipolar thermal conductivity at high temperatures. The final step is using iodine to optimize the carrier concentration to ∼1019 cm–3. Ultimately, a maximum ZT value of ∼1.5 and a large average ZTave value of ∼1.0 at 300–773 K are obtained for Pb1.01Te0.998I0.002 + 0.002Ag. These findings demonstrate that fine tuning of defects with <0.5% impurities can remarkably enhance carrier mobility and improve thermoelectric performance.}, author = {Wang, Siqi and Chang, Cheng and Bai, Shulin and Qin, Bingchao and Zhu, Yingcai and Zhan, Shaoping and Zheng, Junqing and Tang, Shuwei and Zhao, Li Dong}, issn = {1520-5002}, journal = {Chemistry of Materials}, number = {2}, pages = {755--763}, publisher = {American Chemical Society}, title = {{Fine tuning of defects enables high carrier mobility and enhanced thermoelectric performance of n-type PbTe}}, doi = {10.1021/acs.chemmater.2c03542}, volume = {35}, year = {2023}, } @article{12406, abstract = {Let X be a sufficiently large positive integer. We prove that one may choose a subset S of primes with cardinality O(logX) such that a positive proportion of integers less than X can be represented by x2+py2 for at least one p∈S.}, author = {Diao, Yijie}, issn = {1730-6264}, journal = {Acta Arithmetica}, keywords = {Algebra, Number Theory}, pages = {1--17}, publisher = {Instytut Matematyczny}, title = {{Density of the union of positive diagonal binary quadratic forms}}, doi = {10.4064/aa210830-24-11}, volume = {207}, year = {2023}, } @misc{12407, abstract = {As the complexity and criticality of software increase every year, so does the importance of run-time monitoring. Third-party monitoring, with limited knowledge of the monitored software, and best-effort monitoring, which keeps pace with the monitored software, are especially valuable, yet underexplored areas of run-time monitoring. Most existing monitoring frameworks do not support their combination because they either require access to the monitored code for instrumentation purposes or the processing of all observed events, or both. We present a middleware framework, VAMOS, for the run-time monitoring of software which is explicitly designed to support third-party and best-effort scenarios. The design goals of VAMOS are (i) efficiency (keeping pace at low overhead), (ii) flexibility (the ability to monitor black-box code through a variety of different event channels, and the connectability to monitors written in different specification languages), and (iii) ease-of-use. To achieve its goals, VAMOS combines aspects of event broker and event recognition systems with aspects of stream processing systems. We implemented a prototype toolchain for VAMOS and conducted experiments including a case study of monitoring for data races. The results indicate that VAMOS enables writing useful yet efficient monitors, is compatible with a variety of event sources and monitor specifications, and simplifies key aspects of setting up a monitoring system from scratch.}, author = {Chalupa, Marek and Mühlböck, Fabian and Muroya Lei, Stefanie and Henzinger, Thomas A}, issn = {2664-1690}, keywords = {runtime monitoring, best effort, third party}, pages = {38}, publisher = {Institute of Science and Technology Austria}, title = {{VAMOS: Middleware for Best-Effort Third-Party Monitoring}}, doi = {10.15479/AT:ISTA:12407}, year = {2023}, } @article{12421, abstract = {The actin cytoskeleton plays a key role in cell migration and cellular morphodynamics in most eukaryotes. The ability of the actin cytoskeleton to assemble and disassemble in a spatiotemporally controlled manner allows it to form higher-order structures, which can generate forces required for a cell to explore and navigate through its environment. It is regulated not only via a complex synergistic and competitive interplay between actin-binding proteins (ABP), but also by filament biochemistry and filament geometry. The lack of structural insights into how geometry and ABPs regulate the actin cytoskeleton limits our understanding of the molecular mechanisms that define actin cytoskeleton remodeling and, in turn, impact emerging cell migration characteristics. With the advent of cryo-electron microscopy (cryo-EM) and advanced computational methods, it is now possible to define these molecular mechanisms involving actin and its interactors at both atomic and ultra-structural levels in vitro and in cellulo. In this review, we will provide an overview of the available cryo-EM methods, applicable to further our understanding of the actin cytoskeleton, specifically in the context of cell migration. We will discuss how these methods have been employed to elucidate ABP- and geometry-defined regulatory mechanisms in initiating, maintaining, and disassembling cellular actin networks in migratory protrusions.}, author = {Fäßler, Florian and Javoor, Manjunath and Schur, Florian KM}, issn = {1470-8752}, journal = {Biochemical Society Transactions}, keywords = {Biochemistry}, number = {1}, pages = {87--99}, publisher = {Portland Press}, title = {{Deciphering the molecular mechanisms of actin cytoskeleton regulation in cell migration using cryo-EM}}, doi = {10.1042/bst20220221}, volume = {51}, year = {2023}, } @article{12427, abstract = {Let k be a number field and X a smooth, geometrically integral quasi-projective variety over k. For any linear algebraic group G over k and any G-torsor g : Z → X, we observe that if the étale-Brauer obstruction is the only one for strong approximation off a finite set of places S for all twists of Z by elements in H^1(k, G), then the étale-Brauer obstruction is the only one for strong approximation off a finite set of places S for X. As an application, we show that any homogeneous space of the form G/H with G a connected linear algebraic group over k satisfies strong approximation off the infinite places with étale-Brauer obstruction, under some compactness assumptions when k is totally real. We also prove more refined strong approximation results for homogeneous spaces of the form G/H with G semisimple simply connected and H finite, using the theory of torsors and descent.}, author = {Balestrieri, Francesca}, issn = {1088-6826}, journal = {Proceedings of the American Mathematical Society}, number = {3}, pages = {907--914}, publisher = {American Mathematical Society}, title = {{Some remarks on strong approximation and applications to homogeneous spaces of linear algebraic groups}}, doi = {10.1090/proc/15239}, volume = {151}, year = {2023}, }