In the context of two-player games over graphs, a language $L$ is called positional if, in all games using $L$ as winning objective, the protagonist can play optimally using positional strategies, that is, strategies that do not depend on the history of the play. In this work, we describe the class of parity automata recognising positional languages, providing a complete characterisation of positionality for $ω$-regular languages. As corollaries, we establish decidability of positionality in polynomial time, finite-to-infinite and 1-to-2-players lifts, and show the closure under union of prefix-independent positional objectives, answering a conjecture by Kopczyński in the $ω$-regular case.

We show that the first order theory of the homeomorphism group of a compact manifold interprets the full second order theory of countable groups of homeomorphisms of the manifold. The interpretation is uniform across manifolds of bounded dimension. As a consequence, many classical problems in group theory and geometry (e.g.~the linearity of mapping classes of compact $2$--manifolds) are encoded as elementary properties of homeomorphism groups of manifolds. Furthermore, the homeomorphism group uniformly interprets the Borel and projective hierarchies of the homeomorphism group, which gives a characterization of definable subsets of the homeomorphism group. Finally, we prove analogues of Rice's Theorem from computability theory for homeomorphism groups of manifolds. As a consequence, it follows that the collection of sentences that isolate the homeomorphism group of a particular manifold, or that isolate the homeomorphism groups of manifolds in general, is not definable in second order arithmetic, and that membership of particular sentences in these collections cannot be proved in ZFC.

Two $k$-ary Fibonacci recurrences are $a_k(n) = a_k(n-1) + k \cdot a_k(n-2)$ and $b_k(n) = k \cdot b_k(n-1) + b_k(n-2)$. We provide a simple proof that $a_k(n)$ is the number of $k$-regular words over $[n] = \{1,2,\ldots,n\}$ that avoid patterns $\{121, 123, 132, 213\}$ when using base cases $a_k(0) = a_k(1) = 1$ for any $k \geq 1$. This was previously proven by Kuba and Panholzer in the context of Wilf-equivalence for restricted Stirling permutations, and it creates Simion and Schmidt's classic result on the Fibonacci sequence when $k=1$, and the Jacobsthal sequence when $k=2$. We complement this theorem by proving that $b_k(n)$ is the number of $k$-regular words over $[n]$ that avoid $\{122, 213\}$ with $b_k(0) = b_k(1) = 1$ for any~$k \geq 2$. Finally, we conjecture that $|Av^{2}_{n}(\underline{121}, 123, 132, 213)| = a_1(n)^2$ for $n \geq 0$. That is, vincularizing the Stirling pattern in Kuba and Panholzer's Jacobsthal result gives the Fibonacci-squared numbers.

The verification of asynchronous software components poses significant challenges due to the way components interleave and exchange input/output data concurrently. Compositional strategies aim to address this by separating the task of verifying individual components on local properties from the task of combining them to achieve global properties. This paper concentrates on employing symbolic model checking techniques to verify properties specified in Linear-time Temporal Logic (LTL) on asynchronous software components that interact through data ports. Unlike event-based composition, local properties can now impose constraints on input from other components, increasing the complexity of their composition. We consider both the standard semantics over infinite traces as well as the truncated semantics over finite traces to allow scheduling components only finitely many times. We propose a novel LTL rewriting approach, which converts a local property into a global one while considering the interleaving of infinite or finite execution traces of components. We prove the semantic equivalence of local properties and their rewritten version projected on the local symbols. The rewriting is also optimized to reduce formula size and to leave it unchanged when the temporal property is stutter invariant. These methods have been integrated into the OCRA tool, as part of the contract refinement verification suite. Finally, the different composition approaches were compared through an experimental evaluation that covers various types of specifications.

We prove that isomorphism of tournaments of twin width at most $k$ can be decided in time $k^{O(\log k)}n^{O(1)}$. This implies that the isomorphism problem for classes of tournaments of bounded or moderately growing twin width is in polynomial time. By comparison, there are classes of undirected graphs of bounded twin width that are isomorphism complete, that is, the isomorphism problem for the classes is as hard as the general graph isomorphism problem. Twin width is a graph parameter that has been introduced only recently (Bonnet et al., J. ACM 2022), but has received a lot of attention in structural graph theory since then. On directed graphs, it is functionally smaller than clique width. We prove that on tournaments (but not on general directed graphs) it is also functionally smaller than directed tree width (and thus, the same also holds for cut width and directed path width). Hence, our result implies that tournament isomorphism testing is also fixed-parameter tractable when parameterized by any of these parameters. Our isomorphism algorithm heavily employs group-theoretic techniques. This seems to be necessary: as a second main result, we show that the combinatorial Weisfeiler-Leman algorithm does not decide isomorphism of tournaments of twin width at most 35 if its dimension is $o(n)$. (Throughout this abstract, $n$ is the order of the input graphs.)

We devise a polynomial-time algorithm for partitioning a simple polygon $P$ into a minimum number of star-shaped polygons. The question of whether such an algorithm exists has been open for more than four decades [Avis and Toussaint, Pattern Recognit., 1981] and it has been repeated frequently, for example in O'Rourke's famous book [Art Gallery Theorems and Algorithms, 1987]. In addition to its strong theoretical motivation, the problem is also motivated by practical domains such as CNC pocket milling, motion planning, and shape parameterization. The only previously known algorithm for a non-trivial special case is for $P$ being both monotone and rectilinear [Liu and Ntafos, Algorithmica, 1991]. For general polygons, an algorithm was only known for the restricted version in which Steiner points are disallowed [Keil, SIAM J. Comput., 1985], meaning that each corner of a piece in the partition must also be a corner of $P$. Interestingly, the solution size for the restricted version may be linear for instances where the unrestricted solution has constant size. The covering variant in which the pieces are star-shaped but allowed to overlap--known as the Art Gallery Problem--was recently shown to be $\exists\mathbb R$-complete and is thus likely not in NP [Abrahamsen, Adamaszek and Miltzow, STOC 2018 & J. ACM 2022]; this is in stark contrast to our result. Arguably the most related work to ours is the polynomial-time algorithm to partition a simple polygon into a minimum number of convex pieces by Chazelle and Dobkin [STOC, 1979 & Comp. Geom., 1985].

We study the locus of smooth hypersurfaces inside the Hilbert scheme of a smooth projective complex variety. In the spirit of scanning, we construct a map to a continuous section space of a projective bundle, and show that it induces an isomorphism in integral homology in a range of degrees growing with the ampleness of the hypersurfaces. When the ambient variety is a curve, this recovers a result of McDuff about configuration spaces. We compute the rational cohomology of the section space and exhibit a phenomenon of homological stability for hypersurfaces with first Chern class going to infinity. For simply connected varieties, the rational cohomology is shown to agree with the stable cohomology of a moduli space of hypersurfaces, with a peculiar tangential structure, as studied by Galatius and Randal-Williams.

We prove limit theorems for the number of fixed points occurring in a random pattern-avoiding permutation distributed according to a one-parameter family of biased distributions. The bias parameter exponentially tilts the distribution towards favoring permutations with more or fewer fixed points than is typical under the uniform distribution. One case we study features a phase transition where the limiting distribution changes abruptly from negative binomial to Rayleigh to normal depending on the bias parameter.

Within the tensor product $K \mathop{\otimes_{\cal R}} C_2'$ of any ${}^*$-continuous Kleene algebra $K$ with the polycyclic ${}^*$-continuous Kleene algebra $C_2'$ over two bracket pairs there is a copy of the fixed-point closure of $K$: the centralizer of $C_2'$ in $K \mathop{\otimes_{\cal R}} C_2'$. Using an automata-theoretic representation of elements of $K\mathop{\otimes_{\cal R}} C_2'$ à la Kleene, with the aid of normal form theorems that restrict the occurrences of brackets on paths through the automata, we develop a foundation for a calculus of context-free expressions without variable binders. We also give some results on the bra-ket ${}^*$-continuous Kleene algebra $C_2$, motivate the ``completeness equation'' that distinguishes $C_2$ from $C_2'$, and show that $C_2'$ already validates a relativized form of this equation.

We give a characterization of the sets of graphs that are both definable in Counting Monadic Second Order Logic (CMSO) and context-free, i.e., least solutions of Hyperedge-Replacement (HR) grammars introduced by Courcelle and Engelfriet. We prove the equivalence of these sets with: (a) recognizable sets (in the algebra of graphs with HR-operations) of bounded tree-width; we refine this condition further and show equivalence with recognizability in a finitely generated subalgebra of the HR-algebra of graphs; (b) parsable sets, for which there is a definable transduction from graphs to a set of derivation trees labelled by HR operations, such that the set of graphs is the image of the set of derivation trees under the canonical evaluation of the HR operations; (c) images of recognizable unranked sets of trees under a definable transduction, whose inverse is also definable. We rely on a novel connection between two seminal results, a logical characterization of context-free graph languages in terms of tree-to-graph definable transductions, by Courcelle and Engelfriet and a proof that an optimal-width tree decomposition of a graph can be built by an definable transduction, by Bojanczyk and Pilipczuk.

Previous work has axiomatised the cardinality operation in relation algebras, which counts the number of edges of an unweighted graph. We generalise the cardinality axioms to Stone relation algebras, which model weighted graphs, and study the relationships between various axioms for cardinality. This results in simpler cardinality axioms also for relation algebras. We give sufficient conditions for the representability of Stone relation algebras and for Stone relation algebras to be relation algebras.

We study Ramsey like theorems for infinite trees and similar combinatorial tools. As an application we consider the expansion problem for tree algebras.

We refine the weighted type graph technique for proving termination of double pushout (DPO) graph transformation systems. We increase the power of the approach for graphs, we generalize the technique to other categories, and we allow for variations of DPO that occur in the literature.

$\textit{Euclid}$ will provide a powerful compilation of data including spectroscopic redshifts, the angular clustering of galaxies, weak lensing cosmic shear, and the cross-correlation of these last two photometric observables. In this study we extend recently presented $\textit{Euclid}$ forecasts into the Hu-Sawicki $f(R)$ cosmological model, a popular extension of the Hilbert-Einstein action that introduces an universal modified gravity force in a scale-dependent way. Our aim is to estimate how well future $\textit{Euclid}$ data will be able to constrain the extra parameter of the theory, $f_{R0}$, for the range in which this parameter is still allowed by current observations. For the spectroscopic probe, we use a phenomenological approach for the scale dependence of the growth of perturbations in the terms related to baryon acoustic oscillations and redshift-space distortions. For the photometric observables, we use a fitting formula that captures the modifications in the non-linear matter power spectrum caused by the $f(R)$ model. We show that, in an optimistic setting, and for a fiducial value of $f_{R0} = 5 \times 10^{-6}$, $\textit{Euclid}$ alone will be able to constrain the additional parameter $\log f_{R0}$ at the $3\%$ level, using spectroscopic galaxy clustering alone; at the $1.4\%$ level, using the combination of photometric probes on their own; and at the $1\%$ level, using the combination of spectroscopic and photometric observations. This last constraint corresponds to an error of the order of $6 \times 10^{-7}$ at the $1σ$ level on the model parameter $f_{R0} = 5 \times 10^{-6}$. We report also forecasted constraints for $f_{R0} = 5 \times 10^{-5}$ and $f_{R0} = 5 \times 10^{-7}$ and show that in the optimistic scenario, $\textit{Euclid}$ will be able to distinguish these models from $Λ\mathrm{CDM}$ at more than 3$σ$. (abridged)

Automatic structures are first-order structures whose universe and relations can be represented as regular languages. It follows from the standard closure properties of regular languages that the first-order theory of an automatic structure is decidable. While existential quantifiers can be eliminated in linear time by application of a homomorphism, universal quantifiers are commonly eliminated via the identity $\forall{x}. Φ\equiv \neg (\exists{x}. \neg Φ)$. If $Φ$ is represented in the standard way as an NFA, a priori this approach results in a doubly exponential blow-up. However, the recent literature has shown that there are classes of automatic structures for which universal quantifiers can be eliminated by different means without this blow-up by treating them as first-class citizens and not resorting to double complementation. While existing lower bounds for some classes of automatic structures show that a singly exponential blow-up is unavoidable when eliminating a universal quantifier, it is not known whether there may be better approaches that avoid the naïve doubly exponential blow-up, perhaps at least in restricted settings. In this paper, we answer this question negatively and show that there is a family of NFA representing automatic relations for which the minimal NFA recognising the language after eliminating a single universal quantifier is doubly exponential, and deciding whether this language is empty is EXPSPACE-complete. The techniques underlying our EXPSPACE lower bound further enable us to establish new lower bounds for some fragments of Büchi arithmetic with a fixed number of quantifier alternations.

We present a new probabilistic proof of Otter's asymptotic formula for the number of unlabelled trees with a given number of vertices. We additionally prove a new approximation result, showing that the total variation distance between random Pólya trees and random unlabelled trees tends to zero when the number of vertices tends to infinity. In order to demonstrate that our approach is not restricted to trees we extend our results to tree-like classes of graphs.

Kleene Algebra (KA) is a useful tool for proving that two programs are equivalent. Because KA's equational theory is decidable, it integrates well with interactive theorem provers. This raises the question: which equations can we (not) prove using the laws of KA? Moreover, which models of KA are complete, in the sense that they satisfy exactly the provable equations? Kozen (1994) answered these questions by characterizing KA in terms of its language model. Concretely, equivalences provable in KA are exactly those that hold for regular expressions. Pratt (1980) observed that KA is complete w.r.t. relational models, i.e., that its provable equations are those that hold for any relational interpretation. A less known result due to Palka (2005) says that finite models are complete for KA, i.e., that provable equivalences coincide with equations satisfied by all finite KAs. Phrased contrapositively, the latter is a finite model property (FMP): any unprovable equation is falsified by a finite KA. Both results can be argued using Kozen's theorem, but the implication is mutual: given that KA is complete w.r.t. finite (resp. relational) models, Palka's (resp. Pratt's) arguments show that it is complete w.r.t. the language model. We embark on a study of the different complete models of KA, and the connections between them. This yields a novel result subsuming those of Palka and Pratt, namely that KA is complete w.r.t. finite relational models. Next, we put an algebraic spin on Palka's techniques, which yield a new elementary proof of the finite model property, and by extension, of Kozen's and Pratt's theorems. In contrast with earlier approaches, this proof relies not on minimality or bisimilarity of automata, but rather on representing the regular expressions involved in terms of transformation automata.

A finite group is said to be $n$-cyclic if it contains $n$ cyclic subgroups. For a finite group $G$, the ratio of the number of cyclic subgroups to the number of subgroups is known as the cyclicity degree of the group $G$ and is denoted by $cdeg (G)$. In this paper, we classify all $12$-cyclic groups. We also prove that the set of cyclicity degrees for all the finite groups is dense in $[0,1]$, which gives a solution to the problem asked by Tărnăuceanu and Tóth in [20] "For every $a\in [0, 1]$, does there exist a sequence $(G_n)$ of finite groups such that $\lim_{n\to\infty} cdeg(G_n)=a$ "?

We provide a new characterisation of quantum supermaps in terms of an axiom that refers only to sequential and parallel composition. Consequently, we generalize quantum supermaps to arbitrary monoidal categories and operational probabilistic theories. We do so by providing a simple definition of locally-applicable transformation on a monoidal category. The definition can be rephrased in the language of category theory using the principle of naturality, and can be given an intuitive diagrammatic representation in terms of which all proofs are presented. In our main technical contribution, we use this diagrammatic representation to show that locally-applicable transformations on quantum channels are in one-to-one correspondence with deterministic quantum supermaps. This alternative characterization of quantum supermaps is proven to work for more general multiple-input supermaps such as the quantum switch and on arbitrary normal convex spaces of quantum channels such as those defined by satisfaction of signaling constraints.

The study of homomorphisms of $(n,m)$-graphs, that is, adjacency preserving vertex mappings of graphs with $n$ types of arcs and $m$ types of edges was initiated by Nešetřil and Raspaud in 2000. Later, some attempts were made to generalize the switch operation that is popularly used in the study of signed graphs, and study its effect on the above mentioned homomorphism. In this article, we too provide a generalization of the switch operation on $(n,m)$-graphs, which to the best of our knowledge, encapsulates all the previously known generalizations as special cases. We approach the study of homomorphisms with respect to the switch operation axiomatically. We prove some fundamental results that are essential tools in the further study of this topic. In the process of proving the fundamental results, we have provided yet another solution to an open problem posed by Klostermeyer and MacGillivray in 2004. We also prove the existence of a categorical product for $(n,m)$-graphs with respect to a particular class of generalized switch which implicitly uses category theory. This is a counter intuitive solution as the number of vertices in the Categorical product of two $(n,m)$-graphs on $p$ and $q$ vertices has a multiple of $pq$ many vertices, where the multiple depends on the switch. This solves an open question asked by Brewster in the PEPS 2012 workshop as a corollary. We also provide a way to calculate the product explicitly, and prove general properties of the product. We define the analog of chromatic number for $(n,m)$-graphs with respect to generalized switch and explore the interrelations between chromatic numbers with respect to different switch operations. We find the value of this chromatic number for the family of forests using group theoretic notions.

In this article, we study quasi-isospectral operators as a generalization of isospectral operators. The paper contains both expository material and original results. We begin by reviewing known results on isospectral potentials on compact manifolds and finite intervals, and then introduce the notion of quasi-isospectrality. We next investigate the BMT method as a systematic approach to constructing quasi-isospectral Sturm-Liouville operators on a finite interval, and apply it to several boundary value problems. Our main result shows that any two quasi-isospectral closed manifolds of odd dimension are, in fact, isospectral. In addition, we extend classical compactness results for isospectral potentials on low-dimensional manifolds to the quasi-isospectral setting via heat trace asymptotics.

Majorana zero modes are predicted in several solid state systems such as hybrid superconductor-semiconductor structures and topological insulators coupled to superconductors. One of the expected signatures of Majorana modes is the fractional 4$π$ Josephson effect. Evidence in favor of this effect often comes from a.c. Josephson effect measurements and focuses on the observation of missing first or higher odd-numbered Shapiro steps. However, the disappearance of the odd Shapiro steps has also been reported in conventional Josephson junctions where no Majorana modes are expected. In this paper, we present a phenomenological model that displays suppression of the odd Shapiro steps. We perform resistively-shunted junction model calculations and introduce peaks in differential resistance as function of the bias current. In the presence of only the standard 2$π$ Josephson current, for chosen values of peak positions and amplitudes, we can suppress the odd Shapiro steps, or any steps, thus providing a possible explanation for the observation of missing Shapiro steps.

Probabilistic counters are well-known tools often used for space-efficient set cardinality estimation. In this paper, we investigate probabilistic counters from the perspective of preserving privacy. We use the standard, rigid differential privacy notion. The intuition is that the probabilistic counters do not reveal too much information about individuals but provide only general information about the population. Therefore, they can be used safely without violating the privacy of individuals. However, it turned out, that providing a precise, formal analysis of the privacy parameters of probabilistic counters is surprisingly difficult and needs advanced techniques and a very careful approach. We demonstrate that probabilistic counters can be used as a privacy protection mechanism without extra randomization. Namely, the inherent randomization from the protocol is sufficient for protecting privacy, even if the probabilistic counter is used multiple times. In particular, we present a specific privacy-preserving data aggregation protocol based on Morris Counter and MaxGeo Counter. Some of the presented results are devoted to counters that have not been investigated so far from the perspective of privacy protection. Another part is an improvement of previous results. We show how our results can be used to perform distributed surveys and compare the properties of counter-based solutions and a standard Laplace method.

In this paper, we investigate the module-checking problem of pushdown multi-agent systems (PMS) against ATL and ATL* specifications. We establish that for ATL, module checking of PMS is 2EXPTIME-complete, which is the same complexity as pushdown module-checking for CTL. On the other hand, we show that ATL* module-checking of PMS turns out to be 4EXPTIME-complete, hence exponentially harder than both CTL* pushdown module-checking and ATL* model-checking of PMS. Our result for ATL* provides a rare example of a natural decision problem that is elementary yet but with a complexity that is higher than triply exponential-time.

An isogeny class $\mathcal{A}$ of abelian varieties defined over finite fields is said to be "cyclic" if every variety in $\mathcal{A}$ has a cyclic group of rational points. In this paper we study the local cyclicity of Weil-central isogeny classes of abelian varieties, i.e. those with Weil polynomials of the form $f_\mathcal{A}(t)=t^{2g}+at^g+q^g$, as well as the local growth of the groups of rational points of the varieties in $\mathcal{A}$ after finite field extensions. We exploit the criterion: an isogeny class $\mathcal{A}$ with Weil polynomial $f$ is cyclic if and only if $f'(1)$ is coprime with $f(1)$ divided by its radical.

Metric Temporal Logic (MTL) is a popular formalism to specify temporal patterns with timing constraints over the behavior of cyber-physical systems with application areas ranging in property-based testing, robotics, optimization, and learning. This paper focuses on the unified construction of sequential networks from MTL specifications over discrete and dense time behaviors to provide an efficient and scalable online monitoring framework. Our core technique, future temporal marking, utilizes interval-based symbolic representations of future discrete and dense timelines. Building upon this, we develop efficient update and output functions for sequential network nodes for timed temporal operations. Finally, we extensively test and compare our proposed technique with existing approaches and runtime verification tools. Results highlight the performance and scalability advantages of our monitoring approach and sequential networks.

We present measurements of black hole (BH) properties of 861 Type-1 active galactic nuclei (AGNs) in the North Ecliptic Pole (NEP)-Wide field. These AGNs are detected in both optical and mid-infrared (MIR) surveys and are identified as Type-1 AGNs in optical spectroscopic surveys. By performing spectral energy distribution (SED) and line fitting, we obtained their MIR continuum luminosities ($L_{\rm MIR}$) as well as full width at half maximum (FWHM) values for the \ion{C}{4}, \ion{Mg}{2}, H$β$, and H$α$ lines. Using these measurements, we derived bolometric luminosities ($10^{43.20}$--$10^{47.27}~{\rm erg~s^{-1}}$), BH masses ($10^{7.29}$--$10^{9.67}$\,$M_{\odot}$), and Eddington ratios ($10^{-2.74}$--$10^{-0.08}$) for $\sim$450 objects over a wide redshift range ($z=0.09$--$4.71$). The use of $L_{\rm MIR}$ and FWHM values effectively alleviates the effects of dust extinction, enabling reliable estimates of BH properties even for dust-obscured AGNs. Moreover, we find that 34\,\% of the Type-1 AGNs in the NEP-Wide field are dust-obscured, and that their bolometric luminosities can be significantly underestimated without proper dust extinction correction. Our relatively extinction-free BH property estimates can (i) be combined with multi-wavelength data in the NEP-Wide field to facilitate diverse studies of AGN environments, number densities, host galaxies, and related topics, and (ii) serve as fiducial estimates for SPHEREx and other upcoming infrared (IR) spectroscopic missions covering the NEP-Wide field.

In the late Universe, and on cosmological scales, dark matter is conventionally assumed to be collisionless, as a consequence of the strong existing bounds on dark matter interactions at the Cosmic Microwave Background last-scattering surface. Challenging this lore, here we show that dark matter interactions can be naturally weak at early times, but then grow to observationally relevant strengths at very late times, even significantly after reionization. This is realized if dark matter recouples to a dark radiation species in the range of redshifts probed by the current generation of galaxy surveys. We systematically study, for the first time, the phenomenology of this dark matter recoupling scenario. A combination of Cosmic Microwave Background and Baryon Acoustic Oscillation data show that the interaction needs to be weak at present, if the entirety of dark matter couples to dark radiation. From a complementary perspective, a 4% fraction of dark matter could still be strongly interacting today. Implications for a microscopic model realizing the recoupling dynamics are discussed.

In the case when $d<2s$, where $d$ is the space dimension and $s$ is the fractional power of the Laplacian, we study the well-posedness for a cubic nonlinear Schrödinger equation (CNLSE) generated by the fractional Laplacian and involving distributional, or less regular, coefficients. We formulate our problem in the setting of the concept of so-called very weak solutions and prove that it has a very weak solution. Moreover, we prove the uniqueness in some adequate sense as well as the compatibility of the very weak solution with the classical one when the latter exists. Our results cover the classical case when: $d=1, s=1$. A second task in this paper is to conduct some numerical experiments where interesting behaviours of the very weak solution are observed. The obtained result is the first example of the very weak well-posedness in the setting of nonlinear partial differential equations.

In quantum mechanics and finance, numeraire invariance - the unobservability of absolute phase or price scale - fits with a projective and curved state space. This projective geometry has a measurable signature. For spin-one and higher spin systems, the Taylor expansion of directed distance contains a non-zero cubic term, which induces a fundamental asymmetry under the exchange of states. The Second Law, the failure of Maxwell's demon, and the limitations of sequential traders can all be reduced to this asymmetry.