
L-systems are widely used to model and simulate biological growth processes, including plant development. Motivated by the broader goal of automating L-system construction, this paper studies the formal deterministic context-free L-system (D0L-system) inference problem in which the input is a finite, noise-free sequence of strings. We introduce the characteristic graph of a string sequence and prove that the existence of a compatible D0L-system is equivalent to the existence of an independent set of a prescribed size in this graph. This gives polynomial reductions from D0L inference to maximum independent set (MIS) and SAT, and hence an exact classical decision route when combined with an exact MIS or SAT solver. We also describe a Quantum Approximate Optimization Algorithm (QAOA)-based quantum heuristic for generating candidate independent sets. This heuristic is not a decision procedure for D0L inference, and failure of the heuristic is inconclusive rather than a certificate of nonexistence. We include computational validation on 22 generated D0L traces and 8 negative controls, explicitly incorporate known fixed-identity symbols, and report small statevector QAOA simulations. The quantum component is presented as a proof-of-concept candidate generator, not as a claimed quantum speedup; the immediately useful contribution is the characteristic-graph reduction and the exact classical/SAT decision framework it enables.
Let X be a smooth projective toric Fano variety over an algebraically closed field of characteristic zero, and let Θ _X be the set of distinct Bondal–Thomsen line bundles appearing on either factor of the Hanlon–Hicks–Lazarev resolution of 𝒪_Δ . We prove that Θ _X admits an exceptional ordering if and only if Ext _X^q(L,M)=0 for all L,M∈Θ _X and all q>0. Since the diagonal resolution implies that Θ _X generates D^b Coh (X) , either condition is equivalent to the existence of a full strong exceptional ordering of Θ _X . We also give an equivalent toric criterion: for every extremal primitive relation p_1+⋯ +p_h=b_1y_1+⋯ +b_ky_k, one must have ∑ _j b_j≤ 1 . This gives a dimension-independent explanation for a phenomenon previously observed computationally for all smooth projective toric Fano varieties of dimensions at most five. We then study how frequently this condition occurs as the dimension increases. If f(n) denotes the proportion of smooth projective toric Fano n-folds for which the Bondal–Thomsen collection admits a full strong exceptional ordering, then lim _n→∞f(n)=0. More precisely, the number of such n-folds is at most exponential in n, whereas the total number of smooth projective toric Fano n-folds is at least exp (nlog n-2nloglog n-O(n) ).
In this paper we study the Kleshchev multipartitions that label simple modules of certain cyclotomic Hecke algebras with parameters 1 and -1. The 2-residue statistic divides these multipartitions into blocks. We deduce a bivariate generating function for the blocks using representation theory. We also relate the generating functions of multipartitions in a fixed block to string functions associated by Kac and Peterson to irreducible highest weight modules of a type A_1^(1) affine Lie algebra. By considering matrices formed by these generating functions, we reprove some results of Kac–Peterson on string functions using the Macdonald identities of Rosengren–Schlosser. As an application, we obtain new infinite product formulas for these generating functions.
The big (-1) -Jacobi, Bannai–Ito, and (-1) -Meixner–Pollaczek polynomials have appeared in the mathematical physics literature through differential- or difference-reflection eigenvalue problems. We show that these three families are governed by a single alternating mechanism, formulated at the level of orthogonality functionals, transpose operators, and structural identities. Starting from an ordinary orthogonal polynomial sequence in the quadratic variable, the resulting algorithm constructs the direct alternating family and transfers its moments, squared norms, and recurrence coefficients. One regular Geronimus inversion then produces the big (-1) -Jacobi and Bannai–Ito families, whereas the (-1) -Meixner–Pollaczek family is obtained directly.