@inproceedings{18175,
  abstract     = {Large-scale software repositories are a source of insights for software engineering. They offer an unmatched window into the software development process at scale. Their sheer number and size holds the promise of broadly applicable results. At the same time, that very size presents practical challenges for scaling tools and algorithms to millions of projects. A reasonable approach is to limit studies to representative samples of the population of interest. Broadly applicable conclusions can then be obtained by generalizing to the entire population. The contribution of this paper is a standardized experimental design methodology for choosing the inputs of studies working with large-scale repositories. We advocate for a methodology that clearly lays out what the population of interest is, how to sample it, and that fosters reproducibility. Along the way, we discourage researchers from using extrinsic attributes of projects such as stars, that measure some unclear notion of popularity.},
  author       = {Maj, Petr and Muroya Lei, Stefanie and Siek, Konrad and Di Grazia, Luca and Vitek, Jan},
  booktitle    = {38th European Conference on Object-Oriented Programming},
  isbn         = {9783959773416},
  issn         = {1868-8969},
  location     = {Vienna, Austria},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{The fault in our stars: Designing reproducible large-scale code analysis experiments}},
  doi          = {10.4230/LIPIcs.ECOOP.2024.27},
  volume       = {313},
  year         = {2024},
}

@article{18530,
  abstract     = {We explore the notion of history-determinism in the context of timed automata (TA) over infinite timed words. History-deterministic (HD) automata are those in which nondeterminism can be resolved on the fly, based on the run constructed thus far. History-determinism is a robust property that admits different game-based characterisations, and HD specifications allow for game-based verification without an expensive determinization step. We show that the class of timed ω
-languages recognized by HD timed automata strictly extends that of deterministic ones, and is strictly included in those recognised by fully non-deterministic TA. For non-deterministic timed automata it is known that universality is already undecidable for safety/reachability TA. For history-deterministic TA with arbitrary parity acceptance, we show that timed universality, inclusion, and synthesis all remain decidable and are EXPTIME-complete. For the subclass of TA with safety or reachability acceptance, one can decide (in EXPTIME) whether such an automaton is history-deterministic. If so, it can effectively determinized without introducing new automaton states.},
  author       = {Bose, Sougata and Henzinger, Thomas A and Lehtinen, Karoliina and Schewe, Sven and Totzke, Patrick},
  issn         = {1860-5974},
  journal      = {Logical Methods in Computer Science},
  number       = {4},
  pages        = {1--28},
  publisher    = {EPI Sciences},
  title        = {{History-deterministic timed automata}},
  doi          = {10.46298/lmcs-20(4:1)2024},
  volume       = {20},
  year         = {2024},
}

@inproceedings{18955,
  abstract     = {We give a simple proof that assuming the Exponential Time Hypothesis (ETH), determining the winner of a Rabin game cannot be done in time 2o(k log k) · nO(1), where k is the number of pairs of vertex subsets involved in the winning condition and n is the vertex count of the game graph. While this result follows from the lower bounds provided by Calude et al [SIAM J. Comp. 2022], our reduction is considerably simpler and arguably provides more insight into the complexity of the problem. In fact, the analogous lower bounds discussed by Calude et al, for solving Muller games and multidimensional parity games, follow as simple corollaries of our approach. Our reduction also highlights the usefulness of a certain pivot problem — Permutation SAT — which may be of independent interest.},
  author       = {Casares, Antonio and Pilipczuk, Marcin and Pilipczuk, Michał and Souza, Uéverton S. and Thejaswini, K. S.},
  booktitle    = {2024 Symposium on Simplicity in Algorithms},
  isbn         = {9781611977936},
  location     = {Alexandria, VA, United States},
  pages        = {160--167},
  publisher    = {Society for Industrial and Applied Mathematics},
  title        = {{Simple and tight complexity lower bounds for solving Rabin games}},
  doi          = {10.1137/1.9781611977936.16},
  year         = {2024},
}

@inproceedings{18599,
  abstract     = {Hypernode logic can reason about the prefix relation on stutter-reduced finite traces through the stutter-reduced prefix predicate. We increase the expressiveness of hypernode logic in two ways. First, we split the stutter-reduced prefix predicate into an explicit stutter-reduction operator and the classical prefix predicate on words. This change gives hypernode logic the ability to combine synchronous and asynchronous reasoning by explicitly stating which parts of traces can stutter. Second, we allow the use of regular expressions in formulas to reason about the structure of traces. This change enables hypernode logic to describe a mixture of trace properties and hyperproperties.

We show how to translate extended hypernode logic formulas into multi-track automata, which are automata that read multiple input words. Then we describe a fully online monitoring algorithm for monitoring k-safety hyperproperties specified in the logic. We have implemented the monitoring algorithm, and evaluated it on monitoring synchronous and asynchronous versions of observational determinism, and on checking the privacy preservation by compiler optimizations.},
  author       = {Chalupa, Marek and Henzinger, Thomas A and Oliveira da Costa, Ana},
  booktitle    = {Integrated Formal Methods},
  isbn         = {9783031765537},
  issn         = {1611-3349},
  pages        = {151--171},
  publisher    = {Springer Nature},
  title        = {{Monitoring extended hypernode logic}},
  doi          = {10.1007/978-3-031-76554-4_9},
  volume       = {15234},
  year         = {2024},
}

@inproceedings{18177,
  abstract     = {Partially Specified Boolean Networks (PSBNs) represent a family of Boolean models resulting from possible interpretations of unknown update logics. Hybrid extension of CTL (HCTL) has the power to express complex dynamical phenomena, such as oscillations or stability. We present BNClassifier to classify Boolean Networks corresponding to a given PSBN according to criteria specified in HCTL. The implementation of the tool is fully symbolic (based on BDDs). The results are visualised using the machine-learning-based technology of decision trees.},
  author       = {Beneš, Nikola and Brim, Luboš and Huvar, Ondřej and Pastva, Samuel and Šafránek, David},
  booktitle    = {Computational Methods in Systems Biology},
  isbn         = {9783031716706},
  issn         = {1611-3349},
  pages        = {19--26},
  publisher    = {Springer Nature},
  title        = {{BNClassifier: Classifying boolean models by dynamic properties}},
  doi          = {10.1007/978-3-031-71671-3_2},
  volume       = {14971},
  year         = {2024},
}

@inbook{18563,
  abstract     = {I give a personal account about the wave of new research activities that rose in the 1990s on the specification, verification, and control of real-time systems.},
  author       = {Henzinger, Thomas A},
  booktitle    = {Real Time and Such},
  editor       = {Graf, Susanne and Pettersson, Paul and Steffen, Bernhard},
  isbn         = {9783031737503},
  issn         = {1611-3349},
  pages        = {154--164},
  publisher    = {Springer Nature},
  title        = {{Reminiscences of a Real-Time Researcher}},
  doi          = {10.1007/978-3-031-73751-0_12},
  volume       = {15230},
  year         = {2024},
}

@inproceedings{15168,
  abstract     = {A linearly ordered (LO) k-colouring of a hypergraph is a colouring of its vertices with colours 1, … , k such that each edge contains a unique maximal colour. Deciding whether an input hypergraph admits LO k-colouring with a fixed number of colours is NP-complete (and in the special case of graphs, LO colouring coincides with the usual graph colouring). Here, we investigate the complexity of approximating the "linearly ordered chromatic number" of a hypergraph. We prove that the following promise problem is NP-complete: Given a 3-uniform hypergraph, distinguish between the case that it is LO 3-colourable, and the case that it is not even LO 4-colourable. We prove this result by a combination of algebraic, topological, and combinatorial methods, building on and extending a topological approach for studying approximate graph colouring introduced by Krokhin, Opršal, Wrochna, and Živný (2023).},
  author       = {Filakovský, Marek and Nakajima, Tamio Vesa and Opršal, Jakub and Tasinato, Gianluca and Wagner, Uli},
  booktitle    = {41st International Symposium on Theoretical Aspects of Computer Science},
  isbn         = {9783959773119},
  issn         = {1868-8969},
  location     = {Clermont-Ferrand, France},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs}},
  doi          = {10.4230/LIPIcs.STACS.2024.34},
  volume       = {289},
  year         = {2024},
}

@article{9651,
  abstract     = {We introduce a hierachy of equivalence relations on the set of separated nets of a given Euclidean space, indexed by concave increasing functions ϕ:(0,∞)→(0,∞). Two separated nets are called ϕ-displacement equivalent if, roughly speaking, there is a bijection between them which, for large radii R, displaces points of norm at most R by something of order at most ϕ(R). We show that the spectrum of ϕ-displacement equivalence spans from the established notion of bounded displacement equivalence, which corresponds to bounded ϕ, to the indiscrete equivalence relation, coresponding to ϕ(R)∈Ω(R), in which all separated nets are equivalent. In between the two ends of this spectrum, the notions of ϕ-displacement equivalence are shown to be pairwise distinct with respect to the asymptotic classes of ϕ(R) for R→∞. We further undertake a comparison of our notion of ϕ-displacement equivalence with previously studied relations on separated nets. Particular attention is given to the interaction of the notions of ϕ-displacement equivalence with that of bilipschitz equivalence.},
  author       = {Dymond, Michael and Kaluza, Vojtech},
  issn         = {1572-9168},
  journal      = {Geometriae Dedicata},
  publisher    = {Springer Nature},
  title        = {{Divergence of separated nets with respect to displacement equivalence}},
  doi          = {10.1007/s10711-023-00862-3},
  volume       = {218},
  year         = {2024},
}

@article{14660,
  abstract     = {The classical Steinitz theorem states that if the origin belongs to the interior of the convex hull of a set 𝑆⊂ℝ𝑑, then there are at most 2𝑑 points of 𝑆 whose convex hull contains the origin in the interior. Bárány, Katchalski,and Pach proved the following quantitative version of Steinitz’s theorem. Let 𝑄 be a convex polytope in ℝ𝑑 containing the standard Euclidean unit ball 𝐁𝑑. Then there exist at most 2𝑑 vertices of 𝑄 whose convex hull 𝑄′ satisfies 𝑟𝐁𝑑⊂𝑄′ with 𝑟⩾𝑑−2𝑑. They conjectured that 𝑟⩾𝑐𝑑−1∕2 holds with a universal constant 𝑐>0. We prove 𝑟⩾15𝑑2, the first polynomial lower bound on 𝑟. Furthermore, we show that 𝑟 is not greater than 2/√𝑑.},
  author       = {Ivanov, Grigory and Naszódi, Márton},
  issn         = {1469-2120},
  journal      = {Bulletin of the London Mathematical Society},
  number       = {2},
  pages        = {796--802},
  publisher    = {London Mathematical Society},
  title        = {{Quantitative Steinitz theorem: A polynomial bound}},
  doi          = {10.1112/blms.12965},
  volume       = {56},
  year         = {2024},
}

@article{18617,
  abstract     = {Any complex-valued polynomial on (Rn)k decomposes into an algebraic combination of O(n)-invariant polynomials and harmonic polynomials. This decomposition, separation of variables, is granted to be unique if n≥2k−1. We prove that the condition n≥2k−1 is not only sufficient, but also necessary for uniqueness of the separation. Moreover, we describe the structure of non-uniqueness of the separation in the boundary cases when n=2k−2 and n=2k−3.
Formally, we study the kernel of a multiplication map ϕ carrying out separation of variables. We devise a general algorithmic procedure for describing Ker ϕ in the restricted non-stable range k≤n<2k−1. In the full non-stable range n<2k−1, we give formulas for highest weights of generators of the kernel as well as formulas for its Hilbert series. Using the developed methods, we obtain a list of highest weight vectors generating Ker ϕ.},
  author       = {Beďatš, Daniel},
  issn         = {0021-8693},
  journal      = {Journal of Algebra},
  pages        = {281--304},
  publisher    = {Elsevier},
  title        = {{Separation of variables for scalar-valued polynomials in the non-stable range}},
  doi          = {10.1016/j.jalgebra.2024.04.013},
  volume       = {651},
  year         = {2024},
}

@article{13974,
  abstract     = {The Tverberg theorem is one of the cornerstones of discrete geometry. It states that, given a set X of at least (d+1)(r−1)+1 points in Rd, one can find a partition X=X1∪⋯∪Xr of X, such that the convex hulls of the Xi, i=1,…,r, all share a common point. In this paper, we prove a trengthening of this theorem that guarantees a partition which, in addition to the above, has the property that the boundaries of full-dimensional convex hulls have pairwise nonempty intersections. Possible generalizations and algorithmic aspects are also discussed. As a concrete application, we show that any n points in the plane in general position span ⌊n/3⌋ vertex-disjoint triangles that are pairwise crossing, meaning that their boundaries have pairwise nonempty intersections; this number is clearly best possible. A previous result of Álvarez-Rebollar et al. guarantees ⌊n/6⌋pairwise crossing triangles. Our result generalizes to a result about simplices in Rd, d≥2.},
  author       = {Fulek, Radoslav and Gärtner, Bernd and Kupavskii, Andrey and Valtr, Pavel and Wagner, Uli},
  issn         = {1432-0444},
  journal      = {Discrete and Computational Geometry},
  pages        = {831--848},
  publisher    = {Springer Nature},
  title        = {{The crossing Tverberg theorem}},
  doi          = {10.1007/s00454-023-00532-x},
  volume       = {72},
  year         = {2024},
}

@inproceedings{15296,
  abstract     = {In this paper we build a constructive algorithm that returns a rectifiable curve that connects two points in a weakly convex set in a Hilbert space. We have proven that this algorithm converges and obtained an estimate on the curve’s length and compare the length of the curve obtained to known results.},
  author       = {Lopushanski, Mariana and Ivanov, Grigory},
  booktitle    = {AIP Conference Proceedings},
  issn         = {1551-7616},
  location     = {Virtual},
  number       = {1},
  publisher    = {AIP Publishing},
  title        = {{A constructive algorithm for building rectifiable curves in weakly convex sets}},
  doi          = {10.1063/5.0195908},
  volume       = {3030},
  year         = {2024},
}

@inproceedings{18917,
  abstract     = {An eight-partition of a finite set of points (respectively, of a continuous mass distribution) in ℝ³ consists of three planes that divide the space into 8 octants, such that each open octant contains at most 1/8 of the points (respectively, of the mass). In 1966, Hadwiger showed that any mass distribution in ℝ³ admits an eight-partition; moreover, one can prescribe the normal direction of one of the three planes. The analogous result for finite point sets follows by a standard limit argument.
We prove the following variant of this result: Any mass distribution (or point set) in ℝ³ admits an eight-partition for which the intersection of two of the planes is a line with a prescribed direction.
Moreover, we present an efficient algorithm for calculating an eight-partition of a set of n points in ℝ³ (with prescribed normal direction of one of the planes) in time O^*(n^{5/2}).},
  author       = {Aronov, Boris and Basit, Abdul and Ramesh, Indu and Tasinato, Gianluca and Wagner, Uli},
  booktitle    = {40th International Symposium on Computational Geometry},
  isbn         = {9783959773164},
  location     = {Athens, Greece},
  pages        = {8:1--8:15},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{Eight-partitioning points in 3D, and efficiently too}},
  doi          = {10.4230/LIPIcs.SoCG.2024.8},
  volume       = {293},
  year         = {2024},
}

@article{18483,
  abstract     = {In this paper we prove a perturbative version of a remarkable Bialy–Mironov (Ann. Math. 196(1):389–413, 2022) result. They prove non perturbative Birkhoff conjecture for centrally-symmetric convex domains, namely, a centrally-symmetric convex domain with integrable billiard is ellipse. We combine techniques from Bialy–Mironov (Ann. Math. 196(1):389–413, 2022) with a local result by Kaloshin–Sorrentino (Ann. Math. 188(1):315–380, 2018) and show that a domain close enough to a centrally symmetric one with integrable billiard is ellipse. To combine these results we derive a slight extension of Bialy–Mironov (Ann. Math. 196(1):389–413, 2022) by proving that a notion of rational integrability is equivalent to the C0-integrability condition used in their paper.},
  author       = {Kaloshin, Vadim and Koudjinan, Edmond and Zhang, Ke},
  issn         = {1420-8970},
  journal      = {Geometric and Functional Analysis},
  pages        = {1973--2007},
  publisher    = {Springer Nature},
  title        = {{Birkhoff conjecture for nearly centrally symmetric domains}},
  doi          = {10.1007/s00039-024-00695-6},
  volume       = {34},
  year         = {2024},
}

@article{18065,
  abstract     = {We establish a close connection between acceleration and dynamical degree for one-frequency quasi-periodic compact cocycles, by showing that two vectors derived separately from each coincide. Based on this, we provide a dynamical classification of one-frequency quasi-periodic  SO(3, R)-cocycles.},
  author       = {Hou, Xuanji and Pan, Yi and Zhou, Qi},
  issn         = {1090-2082},
  journal      = {Advances in Mathematics},
  publisher    = {Elsevier},
  title        = {{Dynamical classification of analytic one-frequency quasi-periodic SO(3,R)-cocycles}},
  doi          = {10.1016/j.aim.2024.109943},
  volume       = {457},
  year         = {2024},
}

@article{18604,
  abstract     = {A face in a curve arrangement is called popular if it is bounded by the same curve multiple times. Motivated by the automatic generation of curved nonogram puzzles, we investigate possibilities to eliminate the popular faces in an arrangement by inserting a single additional curve. This turns out to be NP-hard; however, it becomes tractable when the number of popular faces is small: We present a randomized FPT-time algorithm where the parameter is the number of popular faces.},
  author       = {De Nooijer, Phoebe and Terziadis, Soeren and Weinberger, Alexandra and Masárová, Zuzana and Mchedlidze, Tamara and Löffler, Maarten and Rote, Günter},
  issn         = {1526-1719},
  journal      = {Journal of Graph Algorithms and Applications},
  number       = {2},
  pages        = {47--82},
  publisher    = {Brown University},
  title        = {{Removing popular faces in curve arrangements}},
  doi          = {10.7155/jgaa.v28i2.2988},
  volume       = {28},
  year         = {2024},
}

@inproceedings{14888,
  abstract     = {A face in a curve arrangement is called popular if it is bounded by the same curve multiple times. Motivated by the automatic generation of curved nonogram puzzles, we investigate possibilities to eliminate the popular faces in an arrangement by inserting a single additional curve. This turns out to be NP-hard; however, it becomes tractable when the number of popular faces is small: We present a probabilistic FPT-approach in the number of popular faces.},
  author       = {De Nooijer, Phoebe and Terziadis, Soeren and Weinberger, Alexandra and Masárová, Zuzana and Mchedlidze, Tamara and Löffler, Maarten and Rote, Günter},
  booktitle    = {31st International Symposium on Graph Drawing and Network Visualization},
  isbn         = {9783031492747},
  issn         = {1611-3349},
  location     = {Isola delle Femmine, Palermo, Italy},
  pages        = {18--33},
  publisher    = {Springer Nature},
  title        = {{Removing popular faces in curve arrangements}},
  doi          = {10.1007/978-3-031-49275-4_2},
  volume       = {14466},
  year         = {2024},
}

@article{18586,
  abstract     = {We prove the Central Limit Theorem and superpolynomial mixing for environment
viewed from the particle process in quasi periodic Diophantine random environment. The main
ingredients are smoothness estimates for the solution of the Poisson equation and local limit asymptotics for certain accelerated walks.},
  author       = {Czudek, Klaudiusz S and Dolgopyat, Dmitry},
  issn         = {1980-0436},
  journal      = {Alea},
  number       = {2},
  pages        = {1853--1865},
  publisher    = {Instituto Nacional de Matematica Pura e Aplicada},
  title        = {{The central limit theorem and rate of mixing for simple random walks on the circle}},
  doi          = {10.30757/ALEA.V21-70},
  volume       = {21},
  year         = {2024},
}

@article{17231,
  abstract     = {In the class of projective billiards, which contains the usual billiards, we exhibit counter-examples to Ivrii's conjecture, which states that in any planar billiard with smooth boundary the set of periodic orbits has zero measure. The counter-examples are polygons admitting a 2-parameters family of n-periodic orbits, with n being either 3 or any even integer greater than 4.},
  author       = {Fiorebe, Corentin},
  issn         = {1553-5231},
  journal      = {Discrete and Continuous Dynamical Systems- Series A},
  number       = {11},
  pages        = {3287--3301},
  publisher    = {AIMS},
  title        = {{Examples of projective billiards with open sets of periodic orbits}},
  doi          = {10.3934/dcds.2024059},
  volume       = {44},
  year         = {2024},
}

@article{18524,
  abstract     = {Recent works have constrained the binary fraction of evolved populations of massive stars in local galaxies such as red supergiants and Wolf–Rayet stars, but the binary fraction of yellow supergiants (YSGs) in the Hertzsprung gap remains unconstrained. Binary evolution theory predicts that the Hertzsprung gap is home to multiple populations of binary systems with varied evolutionary histories. In this paper, we develop a method to distinguish single YSGs from YSG plus O- or B-type main-sequence binaries using optical and ultraviolet photometry, and then apply this method to identify candidate YSG binaries in the Magellanic Clouds. After constructing a set of combined stellar atmosphere models, we find that optical photometry is, given typical measurement and reddening uncertainties, sufficient to discern single YSGs from YSG+OB binaries if the OB-star is at least ∼5M⊙ for Teff,YSG ∼ 4000 K, but requires a ∼20M⊙ OB star for YSGs up to Teff,YSG ∼ 9000 K. For these hotter YSG temperatures, ultraviolet photometry allows binaries with OB companions as small as ∼7M⊙ to be identified. We use color–color spaces developed from these models to search for evidence of excess blue or ultraviolet light in a set of ∼1000 YSG candidates in the Magellanic Clouds. We identify hundreds of candidate YSG binary systems and report a preliminary fraction of YSGs that show a blue/UV color excess of 20%–60%. Spectroscopic follow-up is now required to confirm the true nature of this population.},
  author       = {O’Grady, Anna J.G. and Drout, Maria R. and Neugent, Kathryn F. and Ludwig, Bethany and Götberg, Ylva Louise Linsdotter and Gaensler, B. M.},
  issn         = {1538-4357},
  journal      = {Astrophysical Journal},
  publisher    = {IOP Publishing},
  title        = {{Binary yellow supergiants in the Magellanic Clouds. I. Photometric candidate identification}},
  doi          = {10.3847/1538-4357/ad778a},
  volume       = {975},
  year         = {2024},
}

