Synthesis consists in deciding whether a given labeled transition system (TS) $A$ can be implemented by a net $N$ of type $τ$. In case of a negative decision, it may be possible to convert $A$ into an implementable TS $B$ by applying various modification techniques, like relabeling edges that previously had the same label, suppressing edges/states/events, etc. It may however be useful to limit the number of such modifications to stay close to the original problem, or optimize the technique. In this paper, we show that most of the corresponding problems are NP-complete if $τ$ corresponds to the type of flip-flop nets or some flip-flop net derivatives.

A graph G is a multi-interval PCG if there exist an edge weighted tree T with non-negative real values and disjoint intervals of the non-negative real half-line such that each node of G is uniquely associated to a leaf of T and there is an edge between two nodes in G if and only if the weighted distance between their corresponding leaves in T lies within any such intervals. If the number of intervals is k, then we call the graph a k-interval-PCG; in symbols, G = k-interval-PCG (T, I1, . . . , Ik). It is known that 2-interval-PCGs do not contain all graphs and the smallest known graph outside this class has 135 nodes. Here we prove that all graphs with at most 8 nodes are 2-interval-PCGs, so doing one step towards the determination of the smallest value of n such that there exists an n node graph that is not a 2-interval-PCG.

We classify the maximal algebraic subgroups of Bir(CxPP^1), when C is a smooth projective curve of positive genus.

An absent factor of a string $w$ is a string $u$ which does not occur as a contiguous substring (a.k.a. factor) inside $w$. We extend this well-studied notion and define absent subsequences: a string $u$ is an absent subsequence of a string $w$ if $u$ does not occur as subsequence (a.k.a. scattered factor) inside $w$. Of particular interest to us are minimal absent subsequences, i.e., absent subsequences whose every subsequence is not absent, and shortest absent subsequences, i.e., absent subsequences of minimal length. We show a series of combinatorial and algorithmic results regarding these two notions. For instance: we give combinatorial characterisations of the sets of minimal and, respectively, shortest absent subsequences in a word, as well as compact representations of these sets; we show how we can test efficiently if a string is a shortest or minimal absent subsequence in a word, and we give efficient algorithms computing the lexicographically smallest absent subsequence of each kind; also, we show how a data structure for answering shortest absent subsequence-queries for the factors of a given string can be efficiently computed.

A stable or locally-optimal cut of a graph is a cut whose weight cannot be increased by changing the side of a single vertex. In this paper we study Minimum Stable Cut, the problem of finding a stable cut of minimum weight. Since this problem is NP-hard, we study its complexity on graphs of low treewidth, low degree, or both. We begin by showing that the problem remains weakly NP-hard on severely restricted trees, so bounding treewidth alone cannot make it tractable. We match this hardness with a pseudo-polynomial DP algorithm solving the problem in time $(Δ\cdot W)^{O(tw)}n^{O(1)}$, where $tw$ is the treewidth, $Δ$ the maximum degree, and $W$ the maximum weight. On the other hand, bounding $Δ$ is also not enough, as the problem is NP-hard for unweighted graphs of bounded degree. We therefore parameterize Minimum Stable Cut by both $tw$ and $Δ$ and obtain an FPT algorithm running in time $2^{O(Δtw)}(n+\log W)^{O(1)}$. Our main result for the weighted problem is to provide a reduction showing that both aforementioned algorithms are essentially optimal, even if we replace treewidth by pathwidth: if there exists an algorithm running in $(nW)^{o(pw)}$ or $2^{o(Δpw)}(n+\log W)^{O(1)}$, then the ETH is false. Complementing this, we show that we can, however, obtain an FPT approximation scheme parameterized by treewidth, if we consider almost-stable solutions, that is, solutions where no single vertex can unilaterally increase the weight of its incident cut edges by more than a factor of $(1+\varepsilon)$. Motivated by these mostly negative results, we consider Unweighted Minimum Stable Cut. Here our results already imply a much faster exact algorithm running in time $Δ^{O(tw)}n^{O(1)}$. We show that this is also probably essentially optimal: an algorithm running in $n^{o(pw)}$ would contradict the ETH.

We introduce and analyse the first order Enlarged Enhancement Virtual Element Method (E$^2$VEM) for the Poisson problem. The method allows the definition of bilinear forms that do not require a stabilization term, thanks to the exploitation of higher order polynomial projections that are made computable by suitably enlarging the enhancement (from which comes the prefix of the name E$^2$) property of local virtual spaces. The polynomial degree of local projections is chosen based on the number of vertices of each polygon. We provide a proof of well-posedness and optimal order a priori error estimates. Numerical tests on convex and non-convex polygonal meshes confirm the criterium for well-posedness and the theoretical convergence rates.

We propose an interpretation of multiparty sessions with asynchronous communication as Flow Event Structures. We introduce a new notion of global type for asynchronous multiparty sessions, ensuring the expected properties for sessions, including progress. Our global types, which reflect asynchrony more directly than standard global types and are more permissive, are themselves interpreted as Prime Event Structures. The main result is that the Event Structure interpretation of a session is equivalent, when the session is typable, to the Event Structure interpretation of its global type.

Three one-body profiles that correspond to local fluctuations in energy, in entropy, and in particle number are used to describe the equilibrium properties of inhomogeneous classical many-body systems. Local fluctuations are obtained from thermodynamic differentiation of the density profile or equivalently from average microscopic covariances. The fluctuation profiles follow from functional generators and they satisfy Ornstein-Zernike relations. Computer simulations reveal markedly different fluctuations in confined fluids with Lennard-Jones, hard sphere, and Gaussian core interactions.

Properties of graphene plasmons are greatly affected by their coupling to phonons. While such coupling has been routinely observed in both near-field and far-field graphene spectroscopy, the interplay between coupling strength and mode losses, and its exceptional point physics has not been discussed. By applying a non-Hermitian framework, we identify the transition point between strong and weak coupling as the exceptional point. Enhanced sensitivity to perturbations near the exceptional point is observed by varying the coupling strength and through gate modulation of the graphene Fermi level. Finally, we also show that the transition from strong to weak coupling is observable by changing the incident angle of radiation.

We study the graph parameter elimination distance to bounded degree, which was introduced by Bulian and Dawar in their study of the parameterized complexity of the graph isomorphism problem. We prove that the problem is fixed-parameter tractable on planar graphs, that is, there exists an algorithm that given a planar graph $G$ and integers $d$ and $k$ decides in time $f(k,d)\cdot n^c$ for a computable function~$f$ and constant $c$ whether the elimination distance of $G$ to the class of degree $d$ graphs is at most $k$.

Multilattices are generalisations of lattices introduced by Mihail Benado. He replaced the existence of unique lower (resp. upper) bound by the existence of maximal lower (resp. minimal upper) bound(s). A multilattice will be called pure if it is not a lattice. Multilattices could be endowed with a residuation, and therefore used as set of truth-values to evaluate elements in fuzzy setting. In this paper we exhibit the smallest pure multilattice and show that it is a sub-multilattice of any pure multilattice. We also prove that any bounded residuated multilattice that is not a residuated lattice has at least seven elements. We apply the ordinal sum construction to get more examples of residuated multilattices that are not residuated lattices. We then use these residuated multilattices to evaluate objects and attributes in formal concept analysis setting, and describe the structure of the set of corresponding formal concepts. More precisely, if $\mathcal{A}_i: =(A_i,\le_i,\top_i,\odot_i,\to_i,\bot_i)$, $i=1,2$ are two complete residuated multilattices, $G$ and $M$ two nonempty sets and $(φ, ψ)$ a Galois connection between $A_1^G$ and $A_2^M$ that is compatible with the residuation, then we show that \[\mathcal{C}: =\{(h,f)\in A_1^G\times A_2^M; φ(h)=f \text{ and } ψ(f)=h \}\] can be endowed with a complete residuated multilattice structure. This is a generalization of a result by Ruiz-Calvi{ñ}o and Medina saying that if the (reduct of the) algebras $\mathcal{A}_i$, $i=1,2$ are complete multilattices, then $\mathcal{C}$ is a complete multilattice.

The Knödel graph $W_{Δ,n}$ is a $Δ$-regular bipartition graph on $n\ge 2^Δ$ vertices and $n$ is an even integer. The vertices of $W_{Δ,n}$ are the pairs $(i,j)$ with $i=1,2$ and $0\le j\le n/2-1$. For every $j$, $0\le j\le n/2-1$, there is an edge between vertex $(1, j)$ and every vertex $(2,(j+2^k-1) \mod (n/2))$, for $k=0,1,\cdots,Δ-1$. In this paper we obtain some formulas for evaluating the distance of vertices of the Knödel graph and by them, we provide the formula $diam(W_{Δ,n})=1+\lceil\frac{n-2}{2^Δ-2}\rceil$ for the diameter of $W_{Δ,n}$, where $n\ge (2Δ-5)(2^Δ-2)+4$.

In this paper, we study various hyperbolicity properties for a quasi-compact Kähler manifold $U$ which admits a complex polarized variation of Hodge structures so that each fiber of the period map is zero-dimensional. In the first part, we prove that $U$ is algebraically hyperbolic and that the generalized big Picard theorem holds for $U$. In the second part, we prove that there is a finite étale cover $\tilde{U}$ of $U$ from a quasi-projective manifold $\tilde{U}$ such that any projective compactification $X$ of $\tilde{U}$ is Picard hyperbolic modulo the boundary $X-\tilde{U}$, and any irreducible subvariety of $X$ not contained in $X-\tilde{U}$ is of general type. This result coarsely incorporates previous works by Nadel, Rousseau, Brunebarbe and Cadorel on the hyperbolicity of compactifications of quotients of bounded symmetric domains by torsion-free lattices.

The problems of determining the minimum-sized \emph{identifying}, \emph{locating-dominating} and \emph{open locating-dominating codes} of an input graph are special search problems that are challenging from both theoretical and computational viewpoints. In these problems, one selects a dominating set $C$ of a graph $G$ such that the vertices of a chosen subset of $V(G)$ (i.e. either $V(G)\setminus C$ or $V(G)$ itself) are uniquely determined by their neighborhoods in $C$. A typical line of attack for these problems is to determine tight bounds for the minimum codes in various graphs classes. In this work, we present tight lower and upper bounds for all three types of codes for \emph{block graphs} (i.e. diamond-free chordal graphs). Our bounds are in terms of the number of maximal cliques (or \emph{blocks}) of a block graph and the order of the graph. Two of our upper bounds verify conjectures from the literature - with one of them being now proven for block graphs in this article. As for the lower bounds, we prove them to be linear in terms of both the number of blocks and the order of the block graph. We provide examples of families of block graphs whose minimum codes attain these bounds, thus showing each bound to be tight.

We identify a structural one-body force field that sustains spatial inhomogeneities in nonequilibrium overdamped Brownian many-body systems. The structural force is perpendicular to the local flow direction, it is free of viscous dissipation, it is microscopically resolved in both space and and time, and it can stabilize density gradients. From the time evolution in the exact (Smoluchowski) low-density limit, Brownian dynamics simulations and a novel power functional approximation, we obtain a quantitative understanding of viscous and structural forces, including memory and shear migration.

In a former paper the concept of Bipartite PageRank was introduced and a theorem on the limit of authority flowing between nodes for personalized PageRank has been generalized. In this paper we want to extend those results to multimodal networks. In particular we deal with a hypergraph type that may be used for describing multimodal network where a hyperlink connects nodes from each of the modalities. We introduce a generalisation of PageRank for such graphs and define the respective random walk model that can be used for computations. We state and prove theorems on the limit of outflow of authority for cases where individual modalities have identical and distinct damping factors.

W.~Magnus' representations of submonoids $ E \leq \mbox{End}(F) $ of the endomorphisms of a free group $ F $ of finite rank are generalised by identifying them with the first homology group of $ F $ with particular coefficient modules. By considering a suitable free resolution of the integers over the semidirect product of free groups, a class of representations of the braid group can be obtained on higher homology groups. The resolution shows that the holonomy representations of the braid group and of the Hecke algebra constructed topologically by R.~J.~Lawrence belong to this class.

In this article we study domino tilings of a family of finite regions called Aztec diamonds. Every such tiling determines a partition of the Aztec diamond into five sub-regions; in the four outer sub-regions, every tile lines up with nearby tiles, while in the fifth, central sub-region, differently-oriented tiles co-exist side by side. We show that when n is sufficiently large, the shape of the central sub-region becomes arbitrarily close to a perfect circle of radius n/sqrt(2) for all but a negligible proportion of the tilings. Our proof uses techniques from the theory of interacting particle systems. In particular, we prove and make use of a classification of the stationary behaviors of a totally asymmetric one-dimensional exclusion process in discrete time.

The majority game, modelling a system of heterogeneous agents trying to behave in a similar way, is introduced and studied using methods of statistical mechanics. The stationary states of the game are given by the (local) minima of a particular Hopfield like hamiltonian. On the basis of a replica symmetric calculations, we draw the phase diagram, which contains the analog of a retrieval phase. The number of metastable states is estimated using the annealed approximation. The results are confronted with extensive numerical simulations.

Cluster catalogs selected by optical properties are subject to selection biases, primarily arising from unresolved systems along the line of sight. These biases affect key observables for cluster cosmology, such as the lensing signal and clustering statistics. In this work, we present a fully predictive forward analytical model to quantify the impact of optical-selection bias due to projection effects on cluster density profiles. This is achieved by introducing a scale-dependent parametrization of the optical cluster bias, whose small- and large-scale behaviour is set by the amplitude of projection effects, and by expressing the two-halo component of the density profile in terms of the contributions from off-axis halos along the line of sight. As a case study, we consider a DES Y3-like cluster catalog and validate our model against simulated samples. Our model successfully captures the dependence of the two-halo component on richness boosts induced by projections, as well as its evolution with richness and redshift. It also recovers the overall bias in the projected density profile relative to a randomly selected sample with the same mass distribution. The framework presented here provides a consistent methodology for modeling the impact of line-of-sight structures on the observed richness and density profiles of optically selected clusters, directly linking selection biases to the underlying cosmology and survey specifications.

We study local sensitivity of structured ARX-based data-driven predictive control. Although predictor estimation is linear in the ARX parameters, the lifted multi-step predictor used in MPC depends on them implicitly, which complicates both uncertainty propagation and task-aware regularization. We derive a local first-order linearization of this implicit predictor map. The resulting Jacobian yields both an approximate control-relevant prediction uncertainty term and a task-dependent sensitivity metric for shaping kernel regularization. Numerical results show that the proposed analysis is most useful in weak-excitation regimes, where baseline SS regularization already provides substantial robustness gains and the proposed sensitivity shaping yields a further smaller improvement.

We study the Hodge-to-de Rham spectral sequence for integral projective curves with local complete intersection singularities. We prove that degeneration at the E2-page is equivalent to requiring every singularity to be a quasihomogeneous plane curve singularity. We also show that, in the same local complete intersection setting, the Hochschild-to-cyclic spectral sequence degenerates at the E2-page if and only if the same condition holds

Dissociative ionization processes of simple heterocyclic molecules like pyridine are relevant for an understanding of radiation damage processes in biological material that occur naturally in complex condensed environments. Pyridine can thereby be considered a simple analogue of nucleobases and related ring structures are included in many important biomolecules. We present here a detailed study of dissociative single-photon single and double ionization processes using double imaging photoelectron photoion coincidence spectroscopy, supported by quantum chemical calculations. In the case of single ionization we correlate previously described cationic states to their corresponding ionic dissociation products observed at a photon energy of 23 eV, providing additional information beyond previously reported ion appearance energies. For the case of double ionization by 36 eV photons the analysis of electron-ion-ion triple coincidences provides detailed information on the onsets of various dissociative double ionization pathways, often only different by the locations of single hydrogen atoms. The detailed understanding of dissociative single and double ionization of pyridine is a prerequisite for future studies addressing radiation damage processes of such molecules in complex environments.

We investigate the light statistics of an ensemble of independent motionless two-level atoms in a product state. We identify the conditions under which the cold atomic ensemble emits thermal light statistics characterized by the Gaussian Moment Theorem. For the theorem to hold, we derive for each correlation order two conditions on the atom number and the ratio of coherent to incoherent light emission. We further discuss their validity for atoms either in a pure or mixed state. Our results contribute to the understanding of the generation of thermal light by two-level atoms without interactions among the emitters.

The standard $Λ$CDM cosmological model faces increasing tensions between key observations, motivating tests that probe its underlying assumptions. In a companion letter, we present a model-independent framework that combines derivatives of the angular diameter distance, $d_A(z)$, and the line-of-sight expansion rate, $\mathcal{H}(z)$, to clarify the physical content of FLRW consistency relations and to construct a general-spacetime estimator of the cosmic density field. Here, we apply these tests to data, introducing a non-parametric reconstruction method based on symbolic regression combined with bootstrapping to provide data-driven uncertainty estimates. Using supernova and BAO data, we reconstruct $d_A$, $\mathcal{H}$, and their derivatives, enabling model-independent evaluation of FLRW relations and recovery of the sky-averaged density field over $z \in [0.38, \sim 2]$. Current data are too sparse to tightly constrain $\mathcal{H}(z)$, and the reconstructed density is consistent with both Planck and SH0ES $Λ$CDM. Reconstructed FLRW consistency tests show mild to moderate deviations from FLRW expectations at the $\sim 2$-$4σ$ level, although their significance depends on data selection and reconstruction stability. If these indicated deviations from an FLRW geometry are real, it would signify that most of the cosmological solutions considered for solving the cosmological tensions (evolving/interacting dark energy, new types of matter/energy, modified gravity, etc., within the FLRW framework) are ruled out. These preliminary indications highlight the importance of future, denser distance and expansion rate measurements, as well as further work toward standardizing uncertainty estimation for symbolic regression reconstructions.

The specification synthesis task aims to automatically generate specifications, together with any necessary auxiliary verification annotations, for existing programs. This task is important because such specifications serve as behavioral contracts that support modular reasoning and reusable verification across a codebase. At the same time, it remains challenging because verifier-only feedback is fundamentally incomplete: passing verification establishes soundness, but cannot distinguish weak specifications from strong ones. What is missing is a fine-grained signal for specification completeness. We present SpecRL, a reinforcement learning framework for specification synthesis in Dafny. SpecRL introduces a self-contained pipeline that generates negative tests, i.e., input-output pairs that can never be produced by the program. We use the fraction of these negative tests rejected by a candidate specification as a signal of specification completeness, which is integrated into the reward for RL training. Experiments across four model sizes show that SpecRL improves both specification strength and verification success over SFT and RL with a binary specification-strength reward, generalizes to an out-of-distribution benchmark, and remains competitive on that unseen benchmark compared to much larger general-purpose LLMs.

Axion-like particles (ALPs) produced via the Primakoff process in the cores of Galactic core-collapse supernovae (SNe) could convert into MeV-energy gamma-rays through interactions with the Milky Way's magnetic field. To evaluate the detection prospects for such signals, we perform sensitivity projections for next-generation MeV telescopes by combining hypothetical instrument responses with realistic background estimates. Our analysis incorporates detailed simulations of the expected ALP flux from nearby SNe, the energy-dependent conversion probability in Galactic magnetic fields, and the telescope's angular/energy resolution based on advanced detector designs. Background components are modeled using data from current MeV missions and extrapolated to future sensitivity regimes. Our simulations demonstrate that next-generation telescopes with improved effective areas and energy resolution could achieve sensitivity to photon-ALP couplings as low as gagamma approx 1.61 x 10^-13 GeV^-1 for ALP masses ma < 10^-9 eV in Galactic Center. These results indicate that future MeV missions will probe unexplored regions of ALP parameter space, with conservative estimates suggesting they could constrain gagamma values two orders of magnitude below current astrophysical limits. Such observations would provide the most stringent tests to date for axion-like particles as a dark matter candidate in the ultra-light mass regime.

The generalized Gearhart-Koshy acceleration is a recent exact affine search technique designed for the method of cyclic projections onto hyperplanes, i.e., the Kaczmarz method. However, its convergence properties, particularly the linear convergence rate, have not been thoroughly established. In this paper, we systematically establish the linear convergence of the generalized Gearhart-Koshy accelerated Kaczmarz method for tensor linear systems, proving that it converges linearly to the unique least-norm solution. Our analysis is general and applies to several popular Kaczmarz variants, including incremental, shuffle-once, and random-reshuffling schemes, and demonstrates that this acceleration approach yields a better convergence upper bound compared to the plain Kaczmarz method. We also propose an efficient Gram-Schmidt-based implementation that computes the next iterate in linear time. Building on this implementation, we establish a connection between this acceleration framework and Arnoldi-type Krylov subspace methods, further highlighting its efficiency and potential. Our theoretical results are supported by numerical experiments.

Black hole islands are usually diagnosed through the von Neumann entropy, but the full replica saddle contains more information than survives in the limit $n \to 1$. In this paper we show that the capacity of entanglement can detect that extra structure already within the controlled factorized island branch of JT gravity coupled to a large-$c$ bath. In the late-time high-temperature regime, the entropy plateau remains unchanged at the first nontrivial order, while the capacity acquires a definite correction. This provides a sharp semiclassical example in which nearby replica data are physically meaningful even when the entropy itself appears rigid. Our result shows that the factorized island saddle already carries finite-$n$ information beyond the entropy, and that the capacity is a natural observable for exposing it. More broadly, it highlights that the physics of island saddles is not exhausted by the $n=1$ limit: the surrounding replica geometry can contain additional, and observable, information about how the semiclassical saddle is assembled.

The first measurement of coherent $Υ$(1S) meson photoproduction off heavy nuclei is performed using ultraperipheral lead-lead collisions collected by the CMS experiment at a nucleon-nucleon center-of-mass energy of 5.02 TeV. The nuclear gluonic structure is probed at a nucleon momentum fraction of order $x$ $\sim$ 10$^{-3}$, determined by the kinematics of the process. Owing to the large $Υ$(1S) mass, the measurement reaches the highest scale accessible so far through coherent vector-meson photoproduction, $μ^2$ = 22.4 GeV$^2$, where nonlinear quantum chromodynamics effects are expected to be minimal. In the $Υ$(1S) rapidity range $\lvert y\rvert$ $\lt$ 1, the ratio of the measured photoproduction cross section to a baseline model prediction that neglects nuclear effects is $S_{Υ\text{(1S)}}$ = 0.25 $\pm$ 0.06 (stat) $\pm$ 0.02 (syst), thereby demonstrating nuclear suppression in this process. Expressed in terms of a nuclear gluon suppression factor, the result yields $R_\text{g}^\text{Pb}$($x$ $\approx$ 10$^{-3}$, $μ^2$ = 22.4 GeV$^2$) = 0.55 $\pm$ 0.12 (stat) $\pm$ 0.02 (syst). The measured $R_\text{g}^\text{Pb}$ is only slightly larger than the values previously reported for coherent $ϕ$ photoproduction, despite the probed $μ^2$ differing by approximately two orders of magnitude.