We investigate structural and combinatorial properties of Bi-Cayley graphs defined over cyclic groups of order $p^2q^2$, where $p$ and $q$ are distinct primes. We begin by describing their fundamental group-theoretic underpinnings. The main focus is on analyzing their connectivity, girth, clique number, chromatic number, diameter, and independence number. It is shown that these Bi-Cayley graphs are connected, biregular with explicitly determined degrees, and possess girth three. Furthermore, we prove that their diameter is equal to five. We further extend several results to Bi-Cayley graphs over arbitrary finite groups under suitable restrictions on the connecting set, with particular emphasis on the case where the connecting set consists of all its involutions. These results clarify structural similarities and differences between Cayley graphs and their Bi-Cayley generalizations.

Braids are periodic solutions to the general N-body problem in gravitational dynamics. These solutions seem special and unique, but they may result from rather usual encounters between four bodies. We aim at understanding the existence of braids in the Galaxy by reverse engineering the interactions in which they formed. We simulate self-gravitating systems of N particles, starting with the constructing of a specific braid, and bombard it with a single object. We study how frequently the bombarded braid dissolves in four singles, a triple and a single, a binary and 2 singles, or 2 binaries. The relative proportion of those events gives us insight into how easy it is to generate a braid through the reverse process. It turns out that braids are easily generated from encounters between 2 binaries, or a triple with a single object, independent on the braid's stability. We find that 3 of the explored braids are linearly stable against small perturbations, whereas one is unstable and short-lived. The shortest-lived braid appears the least stable and the most chaotic. nonplanar encounters also lead to braid formation, which, in our experiments, themselves are planar. The parameter space in azimuth and polar angle that lead to braid formation via binary-binary or triple-single encounters is anisotropic, and the distribution has a low fractal dimension. Since a substantial fraction of ~9% of our calculations lead to periodic 3-body systems, braids may be more common than expected. They could form in multi-body interactions. We do not expect many to exist for time, but they may be common as transients, as they survive for tens to hundreds of periodic orbits. We argue that braids are common in relatively shallow-potential background fields, such as the Oort cloud or the Galactic halo. If composed of compact objects, they potentially form interesting targets for gravitational wave detectors.

In 1+1-dimensions, an extension of the canonical solitonic Dym equation has previously been derived both in a geometric torsion evolution context and in the analysis of peakon solitonic phenomena in hydrodynamics. Here, a novel 2+1-dimensional S-integrable extended Dym-type equation is introduced. As Lax pair is constructed and an associated $\bar{\partial}$-dressing scheme detailed. Integrable modulated versions of the 2+1-dimensional extended Dym equation are generated via application of a class of involutory transformations with genesis in classical Ermakov theory.

We introduce a novel analytical approach for studying free-fermion (XX) chains with smoothly varying, site-dependent hoppings and magnetic fields. Building on a discrete WKB-like approximation applied directly to the recurrence relation for the single-particle eigenfunctions, we derive a closed-form expression for the local fermion density profile as a function of the Fermi energy, which is valid for arbitrary fillings, hopping amplitudes and magnetic fields. This formula reproduces the depletion and saturation effects observed in previous studies of inhomogeneous free-fermion chains, and provides a theoretical framework to understand entanglement entropy suppression in these models. We demonstrate the accuracy of our asymptotic formula in several chains with different hopping and magnetic field profiles. Our findings are thus the first step towards an analytical treatment of entanglement in free-fermion chains beyond the reach of conventional field-theoretic techniques.

We continue the work of Belliard, Pimenta and Slavnov (2024) studying the modified rational six vertex model. We find another formula of the partition function for the inhomogeneous model, in terms of a determinant that mix the modified Izergin one and a Vandermonde one. This expression enables us to compute the partition function in the homogeneous limit for the rectangular lattice, and then to study the thermodynamic limit. It leads to a new result, we obtain the first order of free energy with boundary effects in the thermodynamic limit.

It is known that any two trees on the same $n$ leaves can be displayed by a network with $n-2$ reticulations, and there are two trees that cannot be displayed by a network with fewer reticulations. But how many reticulations are needed to display multiple trees? For any set of $t$ trees on $n$ leaves, there is a trivial network with $(t - 1)n$ reticulations that displays them. To do better, we have to exploit common structure of the trees to embed non-trivial subtrees of different trees into the same part of the network. In this paper, we show that for $t \in o(\sqrt{\lg n})$, there is a set of $t$ trees with virtually no common structure that could be exploited. More precisely, we show for any $t\in o(\sqrt{\lg n})$, there are $t$ trees such that any network displaying them has $(t-1)n - o(n)$ reticulations. For $t \in o(\lg n)$, we obtain a slightly weaker bound. We also prove that already for $t = c\lg n$, for any constant $c > 0$, there is a set of $t$ trees that cannot be displayed by a network with $o(n \lg n)$ reticulations, matching up to constant factors the known upper bound of $O(n \lg n)$ reticulations sufficient to display \emph{all} trees with $n$ leaves. These results are based on simple counting arguments and extend to unrooted networks and trees.

Building on a recent construction of Plebanek and Salguero-Alarcón, which solved the Complemented Subspace Problem for $C(K)$-spaces, and the subsequent work of De Hevia, Martínez-Cervantes, Salguero-Alarcón, and Tradacete solving the Complemented Subspace Problem for Banach lattices, we show that the class of Banach lattices is not primary. Specifically, we exhibit a compact Hausdorff space $L$ such that $C(L) \simeq X \oplus \tilde{X}$ and neither $X$ nor $\tilde{X}$ is isomorphic to a Banach lattice. In particular, it also follows that the class of $C(K)$-spaces is not primary.

The Boltzmann equation has been a driving force behind significant mathematical research over the years. Its challenging theoretical complexity, combined with a wide variety of current scientific and technological problems that require numerical simulations based on this model, justifies such interest. This work provides a brief overview of studies and advances on the solution of the linear Boltzmann equation in one- and two-dimensional spatial dimensions. In particular, relevant aspects of the discrete ordinates approximation of the model are highlighted for neutron and photon transport applications, including nuclear safeguards, nuclear reactor shielding problems, and optical tomography. In addition, a short discussion of rarefied gas dynamics problems, relevant, for instance, to the study of micro-electro-mechanical systems, and their connection with the Linearized Boltzmann Equation, is presented. A primary goal of the work is to establish as much as possible the connections between the different phenomena described by the model and the versatility of the analytical methodology, the ADO method, in providing concise and accurate solutions, which are fundamental for numerical simulations.

We study the problem of continuity of derivations over Banach algebras. More specifically, we consider a class of Banach algebras that contain a dense '$C^*$-like' subalgebra. We discuss applications to $L^p$-crossed products and symmetrized $L^p$-crossed products. As an example, our results imply that every derivation over the $L^p$-crossed product $F^p(G,X,α)$ is continuous, provided that $G$ is infinite, finitely generated, has polynomial growth, and acts freely on the compact Hausdorff space $X$.

In 1978, Anderson and White asked whether there is a decomposition of $K_{12}$ into two graphs, one planar and one toroidal. Using theoretical arguments and a computer search of all maximal planar graphs of order 12, we show that no such decomposition exists. We further show that if $G$ is planar of order 12 and $H\subseteq\overline{G}$ is toroidal, then $H$ has at least two fewer edges than $\overline{G}$. A computer search found all 123 unique pairs $\left(G,H\right)$ that make this an equality.

In this paper we provide an explicit tableaux realization for all simple subquotients of a relation Gelfand-Tsetlin $\mathfrak{gl}(n)$-module.

We revisit the notion of equations describing pseudospherical surfaces, starting from the works by Sasaki, whose roots were influenced by the AKNS system, the works by Chern and Tenenblat, until current research topics in the field relating to Cauchy problems involving these equations and their geometric consequences.

In this paper we introduce and study the Maximum-Average Subtensor ($p$-MAS) problem, in which one wants to find a subtensor of size $k$ of a given random tensor of size $N$, both of order $p$, with maximum sum of entries. We are motivated by recent work on the matrix case of the problem in which several equilibrium and non-equilibrium properties have been characterized analytically in the asymptotic regime $1 \ll k \ll N$, and a puzzling phenomenon was observed involving the coexistence of a clustered equilibrium phase and an efficient algorithm which produces submatrices in this phase. Here we extend previous results on equilibrium and algorithmic properties for the matrix case to the tensor case. We show that the tensor case has a similar equilibrium phase diagram as the matrix case, and an overall similar phenomenology for the considered algorithms. Additionally, we consider out-of-equilibrium landscape properties using Overlap Gap Properties and Franz-Parisi analysis, and discuss the implications or lack-thereof for average-case algorithmic hardness.

In this paper we introduce a new two-player zero-sum game whose value function approximates the level set formulation for the geometric evolution by mean curvature of a hypersurface. In our approach the game is played with symmetric rules for the two players and probability theory is involved (the game is not deterministic).

Universal features of chaotic quantum dynamics underlie our understanding of thermalization in closed quantum systems and the complexity of quantum computations. Reversible automaton circuits, comprised of classical logic gates, have emerged as a tractable means to study such dynamics. Despite generating no entanglement in the computational basis, these circuits nevertheless capture many features expected from fully quantum evolutions. In this work, we demonstrate that the differences between automaton dynamics and fully quantum dynamics are revealed by the operator entanglement spectrum, much like the entanglement spectrum of a quantum state distinguishes between the dynamics of states under Clifford and Haar random circuits. While the operator entanglement spectrum under random unitary dynamics is governed by the eigenvalue statistics of random Gaussian matrices, we show evidence that under random automaton dynamics it is described by the statistics of Bernoulli random matrices, whose entries are random variables taking values $0$ or $1$. We study the crossover between automaton and generic unitary operator dynamics as the automaton circuit is doped with gates that introduce superpositions, namely Hadamard or $R_x = e^{-i\fracπ{4}X}$ gates. We find that a constant number of superposition-generating gates is sufficient to drive the operator dynamics to the random-circuit universality class, similar to earlier results on Clifford circuits doped with $T$ gates. This establishes the operator entanglement spectrum as a useful tool for probing the chaoticity and universality class of quantum dynamics.

We consider an elliptic system of Schrödinger-Bopp-Podolsky type in a bounded and smooth domain of R3 with a non constant coupling factor. This kind of system has been introduced in the mathematical literature in [14] and in the last years many contributions appeared. In particular here we present the results in [2] and [34] which show existence of solutions by means of the Ljusternik-Schnirelmann theory under different boundary conditions on the electrostatic potential.

Tensor networks like matrix product states (MPSs) and matrix product operators (MPOs) are powerful tools for representing exponentially large states and operators, with applications in quantum many-body physics, machine learning, numerical analysis, and other areas. In these applications, computing a compressed representation of the MPO--MPS product is a fundamental computational primitive. For this operation, this paper introduces a new single-pass, randomized algorithm, called successive randomized compression (SRC), that improves on existing approaches in speed or in accuracy. The performance of the new algorithm is evaluated on synthetic problems and unitary time evolution problems for quantum spin systems.

For a smooth affine algebraic group $G$ over an algebraically closed field, we consider several two-variables generalizations of the affine Grassmannian $G(\!(t)\!)/G[\![t]\!]$, given by quotients of the double loop group $G(\!(x)\!)(\!(y)\!)$. We prove that they are representable by ind-schemes if $G$ is solvable. Given a smooth surface $X$ and a flag of subschemes of $X$, we provide a geometric interpretation of the two-variables Grassmannians, in terms of bundles and trivialisation data defined on appropriate loci in $X$, which depend on the flag.

We develop foundational aspects of stability theory in affine logic. On the one hand, we prove appropriate affine versions of many classical results, including definability of types, existence of non-forking extensions, and other fundamental properties of forking calculus. Most notably, stationarity holds over arbitrary sets (in fact, every type is Lascar strong). On the other hand, we prove that stability is preserved under direct integrals of measurable fields of structures. We deduce that stability in the extremal models of an affine theory implies stability of the theory. We also deduce that the affine part of a stable continuous logic theory is affinely stable, generalising the result of preservation of stability under randomisations.

We identify the size of the largest connected component in a subcritical inhomogeneous random graph with a kernel of preferential attachment type. The component is polynomial in the graph size with an explicitly given exponent, which is strictly larger than the exponent for the largest degree in the graph. This is in stark contrast to the behaviour of inhomogeneous random graphs with a kernel of rank one. Our proof uses local approximation by branching random walks going well beyond the weak local limit and novel results on subcritical killed branching random walks.

Differential linear categories provide the categorical semantics of the multiplicative and exponential fragments of Differential Linear Logic. Briefly, a differential linear category is a symmetric monoidal category that is enriched over commutative monoids (called additive enrichment) and has a monoidal coalgebra modality that is equipped with a codereliction. The codereliction is what captures the ability of differentiating non-linear proofs via linearization in Differential Linear Logic. The additive enrichment plays an important role since it allows one to express the famous Leibniz rule. However, the axioms of a codereliction can be expressed without any sums or zeros. Therefore, it is natural to ask if one can consider a possible non-additive enriched version of differential linear categories. In this paper, we show that even if a codereliction can technically be defined in a non-additive setting, it nevertheless induces an additive enrichment via bialgebra convolution. Thus, we obtain a novel characterization of a differential linear category as a symmetric monoidal category with a monoidal bialgebra modality equipped with a codereliction. Moreover, we also show that coderelictions are, in fact, unique. We also introduce monoidal Hopf coalgebra modalities and discuss how antipodes relate to enrichment over Abelian groups.

We introduce a geometric model of shallow multiplicative exponential linear logic (MELL) using the Hilbert scheme. Building on previous work interpreting multiplicative linear logic proofs as systems of linear equations, we show that shallow MELL proofs can be modeled by locally projective schemes. The key insight is that while multiplicative linear logic proofs correspond to equations between formulas, the exponential fragment of shallow proofs corresponds to equations between these equations. We prove that the model is invariant under cut-elimination by constructing explicit isomorphisms between the schemes associated to proofs related by cut-reduction steps. A key technical tool is the interpretation of the exponential modality using the Hilbert scheme, which parameterizes closed subschemes of projective space. We demonstrate the model through detailed examples, including an analysis of Church numerals that reveals how the Hilbert scheme captures the geometric content of promoted formulas. This work establishes new connections between proof theory and algebraic geometry, suggesting broader relationships between computation and scheme theory.

In this paper we prove disintegration results for self-conformal measures and affinely irreducible self-similar measures. The measures appearing in the disintegration resemble self-conformal/self-similar measures for iterated function systems satisfying the strong separation condition. As an application of our results, we prove the following Diophantine statements: 1. Using a result of Pollington and Velani, we show that if $μ$ is a self-conformal measure in $\mathbb{R}$ or an affinely irreducible self-similar measure, then there exists $α>0$ such that for all $β>α$ we have $$μ\left(\left\{\mathbf{x}\in \mathbb{R}^{d}:\max_{1\leq i\leq d}|x_{i}-p_i/q|\leq \frac{1}{q^{\frac{d+1}{d}}(\log q)^β}\textrm{ for i.m. }(p_1,\ldots,p_d,q)\in \mathbb{Z}^{d}\times \mathbb{N}\right\}\right)=0.$$ 2. Using a result of Kleinbock and Weiss, we show that if $μ$ is an affinely irreducible self-similar measure, then $μ$ almost every $\mathbf{x}$ is not a singular vector.

In this article, we study the pressure at infinity of potentials defined over countable Markov shifts. We establish an upper semi-continuity result concerning the limiting behaviour of the pressure of invariant probability measures, where the escape of mass is controlled by the pressure at infinity. As a consequence, we establish criteria for the existence of equilibrium states and maximizing measures for uniformly continuous potentials. Additionally, we study the pressure at infinity of suspension flows defined over countable Markov shifts and prove an upper semi-continuity result for the pressure map.

We construct a 2-functor from the Kac-Moody 2-category for the extended quantum affine sl(3) to the homotopy 2-category of bounded chain complexes with values in the Kac-Moody 2-category for quantum gl(3), categorifying the evaluation map between the corresponding quantum Kac-Moody algebras.

Levels of cancellativity in commutative monoids $M$, determined by stable rank values in $\mathbb{Z}_{> 0} \cup \{\infty\}$ for elements of $M$, are investigated. The behavior of the stable ranks of multiples $ka$, for $k \in \mathbb{Z}_{> 0}$ and $a \in M$, is determined. In the case of a refinement monoid $M$, the possible stable rank values in archimedean components of $M$ are pinned down. Finally, stable rank in monoids built from isomorphism or other equivalence classes of modules over a ring is discussed.

In this paper, we introduce the deformed homogeneous polynomials $\mathrm{R}_{n}(x,y;u|q)$. These polynomials generalize some classical polynomials: the Rogers-Szegö polynomials $\mathrm{h}_{n}(x|q)$, the generalized Rogers-Szegö polynomials $\mathrm{r}_{n}(x,y)$, the Stieltjes-Wigert polynomials $\mathrm{S}_{n}(x;q)$, among others. Basic properties of the polynomial $\mathrm{R}_{n}$ are given, along with recurrence relations, its $q$-difference equation, and representations. Generating functions for the polynomials $\mathrm{R}_{n}(x,y;u|q)$ are given. These functions include generalizations of the Mehler and Rogers formulas. In addition, generalizations of the $q$-binomial formula and the Heine transformation formula are obtained. These results are obtained via the $u$-deformed $q$-exponential operator $\mathrm{E}(yD_{q}|u)$, defined here. From this operator, we obtain for free the operators T$(yD_{q})$ the Chen, $\mathrm{R}(yD_{q})$ of Saad, $\mathcal{E}(yD_{q})$ of Exton, and $\mathcal{R}(yD_{q})$ of Rogers-Ramanujan when $u=1,q,\sqrt{q},q^2$, respectively. We introduce the deformed basic hypergeometric series ${}_{r}Φ_{s}$, a generalization of the classical basic hypergeometric series. New transformation formulas for basic hypergeometric series are obtained.

We introduce a generating function approach to the affine Brauer and Kauffman categories and show how it allows one to efficiently recover important sets of relations in these categories. We use this formalism to deduce restrictions on possible categorical actions and show how this recovers admissibility results that have appeared in the literature on cyclotomic Birman-Murakami-Wenzl (BMW) algebras and their degenerate versions, also known as cyclotomic Nazarov-Wenzl algebras or VW algebras.

The purpose of this paper is to analyze the degree index and clustering index in random graphs. The degree index in our setup is a certain measure of degree irregularity whose basic properties are well studied in the literature, and the corresponding theoretical analysis in a random graph setup turns out to be tractable. On the other hand, the clustering index, based on a similar reasoning, is first introduced in this manuscript. Computing exact expressions for the expected clustering index turns out to be more challenging even in the case of Erdős-Rényi graphs, and our results are on obtaining relevant upper bounds. These are also complemented with observations based on Monte Carlo simulations. Besides the Erdős-Rényi case, we also do simulation-based analysis for random regular graphs, the Barabási-Albert model and the Watts-Strogatz model.

Let $Δ,q\geq 3$ be integers. We prove that there exists $η\geq 0.002$ such that if $q\geq (2-η)Δ$, then there exists an open set $\mathcal{U}\subset \mathbb{C}$ that contains the interval $[0,1]$ such that for each $w\in \mathcal{U}$ and any graph $G=(V,E)$ of maximum degree at most $Δ$, the partition function of the anti-ferromagnetic $q$-state Potts model evaluated at $w$ does not vanish. This provides a (modest) improvement on a result of Liu, Sinclair, and Srivastava, and breaks the $q=2Δ$-barrier for this problem. As a direct consequence we obtain via Barvinok's interpolation method a deterministic polynomial time algorithm to approximate the number of proper $q$-colorings of graphs of maximum degree at most $Δ$, provided $q\geq (2-η)Δ$.