When $S$ is a finite set of positive integers, we can consider classical Subtraction Nim with $S$ as the set of removable numbers. Even when $S$ consists of three elements, many questions remain unanswered. For example, we do not have a period formula of the Nim value. In this paper, we generalize $S$ to be a finite set of positive real numbers. We found that in some regions, we can give concrete formulae for the period and the Nim value function. In particular when $S$ consists of three elements, we found sufficient conditions for the Nim value function to be purely periodic with the period which is equal to the sum of two of elements of $S$. To be more precise, let $S = {a,b,c}$ with $0 < a < b < c$, then for example when $a \leq b \leq 2a$ with $a+b \geq c$, the Nim value function is purely periodic with a period $a+c$. There are much more regions with precise period formulae. We have also some generalizations for the cases $|S| \geq 4$. Even when $S$ consists of integers, these results seem to be new.

Recent advances in scientific machine learning provide a means of near-real-time solution to partial differential equations (PDEs), but lack the theoretical underpinnings of conventional simulators that support contemporary verification and validation. In this work, we construct data-driven reduced-order models that serve as structure-preserving, real-time surrogates. Remarkably, the exterior calculus that imposes physical conservation structure also exposes topological structure that we use to build a Gaussian process (GP) representation of uncertainty in state-flux relationships, ultimately yielding a Dirichlet-to-Neumann map for quantities of interest with closed-form expressions for posterior uncertainty. We specifically propose structure-preserving $H(\mathrm{div})$--$L^2$ subspaces of conventional Raviart--Thomas and $dgP_0$ elements prescribed by a lightweight transformer. Reduced-order dynamics consistent with this subspace are learned by posing a conservation law in which a GP describes the fluxes between volumes. This work hinges on a novel interface between mixed FEM spaces and GP regression; when training is posed as the optimal recovery problem (ORP), the resulting GP regression can be written as an optimization problem with equality constraints that impose a conservation structure, amenable to a fast Schur-complement training strategy. The trained model can then be solved in real time with closed-form estimators for boundary fluxes driven by prescribed Dirichlet data. The paper includes RKHS posterior error bounds for linear functionals to support uncertainty quantification, as well as numerical experiments demonstrating the accuracy of the posterior distribution as a surrogate for error estimation.

For every fixed $t\ge 1$, we prove a parity analogue of the mighty Erdős-Hajnal property for $t$-intersecting curves in the plane. Let $\mathcal B$ be a set of blue curves and $\mathcal G$ a set of green curves in the plane such that $\mathcal B\cup\mathcal G$ is a collection of $t$-intersecting curves in general position. We show that there exist subfamilies $\mathcal B'\subseteq\mathcal B$ and $\mathcal G'\subseteq\mathcal G$ such that $|\mathcal B'|\geq \varepsilon|\mathcal B|$ and $|\mathcal G'|\geq \varepsilon|\mathcal G|$, where $\varepsilon>0$ depends only on $t$, such that either every pair in $\mathcal B'\times\mathcal G'$ intersects an even number of times or every such pair intersects an odd number of times. For $t=1$, this recovers the theorem of Fox, Pach, and Suk for pseudo-segments. As an application, we show that every $n$-vertex topological graph with edges forming a $t$-intersecting family and with no $k$ edges that pairwise cross an odd number of times has at most $n(\log n)^{O_t(\log k)}$ edges.

If A is a symmetric algebra, then Hochschild homology of the dg enhancement of the singularity category of A agrees with singular Hochschild homology of A. For a basic finite dimensional k algebra A, the Cartan matrix of A is symmetric if and only if the k dual of the mixed complex of the dg enhancement of its singularity category is isomorphic to its shift by -1. We provide two counterexamples to show that neither result holds for general Frobenius algebras.

Let $\lambda_i(G)$ denote the $i$-th largest eigenvalue of adjacency matrix of a graph $G$. Gerschgorin's Theorem indicates $\lambda_1(G)$ belongs to the largest disk, i.e., $\lambda_1(G)\le\Delta_1(G)$, where $\Delta_i(G)$ is the $i$-th largest degree of $G$. We show that $\lambda_2(G)$ lies in the second largest disk. That is, in detail, $$\lambda_2(G)<\Delta_2(G)-\frac{1}{n^2}.$$ A classical theorem proved by Hong [\textit{Linear Algebra Appl.} 1988] states that $\lambda_1(G)\le\sqrt{2m-n+1}$ for a connected graph $G$ with $n$ vertices and $m$ edges, where the equality holds if and only if $G$ is a star $S_n$ or a complete graph $K_n$. We give a refinement of Hong's theorem by showing $$\lambda_1(G)<\sqrt{2m-n}$$ for any connected graph $G\not\in\left\{S_n,S^1_{n-1},K_n,K^1_{n-1}\right\}$. Based on this improved upper bound of $\lambda_1(G)$, for a connected graph $G$ with $n$ vertices and $m$ edges, we are able to prove a sharp upper bound of $\lambda_2(G)$ that $$\lambda_2(G)\le\sqrt{m-\frac{n}{2}-\frac{1}{2}},$$ except $G$ is obtained from two disjoint $S_\frac{n}{2}$ by adding an edge between a pendant vertex of each star. Moreover, we provide a complete characterization to extremal graphs attaining the equality.

This manuscript proposes an integral formulation of the newly defined quadratic embedding method for identifying nonlinear systems (QENDy). In the original algorithm, trajectory data points along with their time derivatives are used. Methods for calculating time derivatives make the algorithm sensitive to noise. Our integral formulation does not use the time derivatives. This results in a more robust method to learn the dynamics.

In this paper, we demonstrate the effects on the second largest eigenvalue $\lambda_2(G)$ of a connected graph $G$ after edge addition or deletion. In 1989, Chung, Graham and Wilson showed $\max\{|\lambda_2|,|\lambda_n|\}>\Omega(n)$ for dense $K_{r+1}$-free graphs of order $n$, giving spectral comprehension of existence of large clique or independent set, respect to Ramsey theory. Applying the results of effects on $\lambda_2$ after edge operations, we determine the maximum value of $\lambda_2$ among all $K_{r+1}$-free connected graphs with given order, and completely characterize the extremal graphs. Moreover, for arbitrary given graph $F$, we investigates the maximum second largest $\lambda_2(G)$ among $F$-free connected graphs of order $n$. Let $\rho^*(n,F)$ be the maximum spectral radius of $F$-free graphs on $n\ge n_F$ vertices, and $G^*(n,F)$ be a graph with its spectral radius $\rho\big(G^*(n,F)\big)=\rho^*(n,F)$. We prove that, for an $F$-free connected graph $G$ of order $n\ge f(n_F)$, \\(1) if $n$ is odd, then $$\lambda_2(G)\le\rho^*\left(\frac{n-1}{2},F\right)$$ with equality if and only if $G\in \mathcal{I}\big(G^*(\frac{n-1}{2},F),G^*(\frac{n-1}{2},F)\big)$; and\\ (2) if $n$ is even, and $F$ does not contain cut edges, then the graph $G^†$ with the maximum second largest eigenvalue satisfies $$\lambda_2(G^†)=\rho^*\left(\frac{n}{2},F\right)-o(1)$$ and $G^†\in \mathcal{E}\big(H_1,H_2\big)$, where $H_1$ and $H_2$ are $F$-saturated graphs on $\frac{n}{2}$ vertices. In particular, other than a complete graph $K_{r+1}$, when $F$ is a book graph $B_{k+1}$ or an odd cycle $C_{2k+1}$, we are able to determine the maximum second largest eigenvalue for $F$-free connected graphs of given order, and completely characterize the extremal graphs.

The coefficients $A_n(\alpha,\beta,\omega)$ in the Maclaurin expansion $(1+\omega z)^{\alpha}(1-z)^{-\beta}=\sum_{n=0}^{\infty} A_n(\alpha,\beta,\omega)z^n$ are considered for $|\omega|=1$ and $\alpha,\beta\in(0,1]$. D. A. Brannan conjectured in a 1973 paper that $|A_n(\alpha,\beta,\omega)|\le A_n(\alpha,\beta,1)$ for every positive odd integer $n$. The present author recently established the conjecture outside a small neighbourhood of $\omega=-1$. The remaining range is treated here by combining compound Laplace integral representations with two types of local approximation: a Meijer $G$ function approximation for $n|\arg(-\omega)|$ bounded, and a modified Watson approximation for the complementary range. The resulting lower bounds reduce the problem to numerical positivity checks for explicit functions on compact parameter sets. These computations verify the inequality for all $\alpha,\beta\in(0,1]$ and all odd integers $n\ge5$, and hence, together with Brannan's result for $n=3$, complete the proof of his conjecture.

In this paper we establish sharp global $C^{1,\alpha}$ regularity for a class of degenerate/singular fully nonlinear elliptic equations featuring Hamiltonian structures. The results presented in this paper serve as the boundary counterpart to the interior regularity estimates recently derived in \cite{AN25b, HJMZ26}, and substantially generalize the existing regularity theory developed in \cite{BBLL24b, BSRR23, BD14}. The optimal regularity is established within the framework of Caffarelli's perturbation argument \cite{C89, CC95}.

Tensor train (TT) decomposition is a powerful method to acquire low-rank tensors. However, the computational process is frequently obstructed by the large-scale matrix singular value decomposition (SVD). The sketching algorithm serves as an efficient data compression technique that can quickly derive low-rank matrix approximations. In this paper, we propose a randomized algorithm to obtain the TT approximation of tensors using a one-pass sketching algorithm and subspace iteration, and offer thorough error-bound and robustness analysis. Numerical experiments on synthetic and real-world datasets demonstrate the effectiveness and efficiency of the proposed algorithm.

For a uniformly locally finite coarse space $(X,\mathcal{E})$, we prove that for every $p\in\{0\}\cup[1,\infty]$, the lattice of geometric ideals in the $\ell^p$ uniform Roe algebra $B^p_u(X,\mathcal{E})$ is isomorphic to the lattice of ideals of $\mathcal{E}$ (equivalently, to the lattice of ideals in the associated family of controlled partial coverings of $X$). In particular, the lattices of geometric ideals for different values of $p$ coincide. Using limit operators, we establish a canonical isometric isomorphism between $B^p_u(X,\mathcal{E})$ and the reduced $L^p$ operator algebra of the coarse groupoid for $p\in[1,\infty]$, and show that it induces an isomorphism between lattices of ideals that preserves inner support. In particular, geometric (resp. ghostly) ideals correspond precisely to dynamical (resp. restrictive) ideals under this isomorphism. Using equivalent formulations of property A for coarse spaces, we prove that for $p\in(1,\infty)$, property A implies that $B^p_u(X,\mathcal{E})$ admits a multiplier approximate identity with controlled propagation, that all ideals are geometric, and that all ghosts are trivial. For the extreme cases $p\in\{0,1,\infty\}$, these properties hold for every uniformly locally finite coarse space without assuming Property A. Finally, for $p\in[1,\infty)$, a Morita equivalence between the $\ell^p$ uniform Roe algebra and the $\ell^p$ uniform algebra is shown to preserve the lattice of geometric ideals.

This paper investigates the three-dimensional compressible Navier--Stokes system with a polytropic pressure law and its pressureless counterpart arising from the high Mach number limit. We focus on the different critical scaling structures of these two models. In the presence of the pressure term, the pressure gradient is balanced with the inertial and viscous effects, and thereby selects a fixed critical scaling for the pressure system. In contrast, once the pressure term is ignored, the pressureless system admits a more flexible one-parameter family of invariant scalings. For both systems, we establish the global well-posedness of strong solutions under low-regularity assumptions on the initial data, allowing vacuum and large oscillations. This improves the global result of Wen (Adv. Math. 482 (2025), Paper No. 110628), where higher regularity assumptions on the initial data are required. A central feature of our result is that the smallness conditions are {\it exactly invariant} under the intrinsic critical scalings of the corresponding systems. These scaling structures differ from the usual parabolic scaling used in the critical-space framework of Danchin (Invent. Math. 141 (2000), pp. 579--614), where the system is reformulated around a reference state. We also derive uniform a \textit{priori} estimates and obtain exponential decay estimates for the global strong solutions. The results show that the pressure term not only changes the analytic estimates, but also plays a decisive role in selecting the critical scaling structure and in determining the dynamical behavior of compressible flows.

We develop a new technique to upgrade relative biexactness in general von Neumann algebras: suppose that $\{N_i\}_{i\in I}\subset M$ are mixing and biexact subalgebras of a separable von Neumann algebra with expectation, and if $M$ is biexact relative to $\{N_i\}_{i\in I}$, then $M$ is biexact. This result yields several new examples of biexact von Neumann algebras, notably including amalgamated free products. By generalizing the relative biexactness results of Hoshino to the von Neumann algebra setting and applying our result above along with certain bimodule computations, we in fact obtain, as an application, a new classification result for biexactness for graph products of finite dimensional von Neumann algebras. This yields significant extensions of prior works of Caspers-Borst, and Blufstein-Goldman-Oyakawa.

Why do similar funding shocks generate sharply different credit outcomes across countries? We develop and estimate a dynamic structural model in which intermediary credit capacity governs the transmission of funding disruptions to lending. Using supervisory data on U.S. banks and credit unions and Brazilian banks and cooperatives from 2002--2025, we recover institution-level credit capacity and its dynamics across major crisis episodes. Credit capacity is three to six times larger in the United States than in Brazil, while persistence is similar across countries. As a result, funding shocks generate substantially larger and more persistent lending contractions in Brazil. Counterfactual analysis shows that differences in baseline credit capacity, rather than persistence, account for most cross-country variation in crisis propagation and policy effectiveness.

Let $G$ be a locally finite multigraph that is bipartite and "unbalanced," meaning that it has a nontrivial bipartition $(A,B)$ with $°(x) > °(y)$ for all $x \in A$ and $y \in B$. We explore matchings in such graphs through the lens of descriptive set theory. In particular, we show that when $G$ is Borel and $\mu$ is a Borel probability measure on its vertex set, there is a Borel matching in $G$ that covers $\mu$-almost every vertex in $A$. This was previously known only under the assumption that $\mu$ is $G$-invariant, which we eliminate using a novel probabilistic approach. We also describe various extra conditions that imply the existence of a Borel matching covering every vertex in $A$. Along the way, we confirm a conjecture of the first and third named authors concerning the existence of Borel independent complete sections in Borel graphs of finite asymptotic separation index. In addition to their intrinsic interest, our results have applications to various other topics, such as edge-colorings, balanced orientations, and equidecomposition theory for group actions. For example, we show that the measurable edge-chromatic number of every Borel multigraph with finite maximum degree $\Delta$ is at most $\lfloor\frac{3\Delta}{2}\rfloor$, matching Shannon's optimal bound for finite multigraphs. Another example is that paradoxical Borel group actions with finite asymptotic separation index admit paradoxical decompositions with Borel pieces. This refines a result of Marks and Unger.

This paper investigates an inverse problem for the simultaneous reconstruction of two spatially varying reaction coefficients, the local proliferation rate and the competition (saturation) coefficient, together with the unknown initial condition, in a nonlinear, density-dependent reaction-diffusion model motivated by cell invasion and tumor growth dynamics. Using Carleman estimates, we establish a global uniqueness result together with a Lipschitz-type stability estimate for the reaction coefficients and a weaker, logarithmic stability estimate for the initial condition. For the numerical reconstructions, we develop a two-stage algorithm employing a time-shift strategy to decouple the coefficient and the initial condition. Numerical experiments are presented to illustrate the feasibility, accuracy, and robustness of the proposed inversion method.

In this paper we develop a combinatorial algorithm to compute the Gelfand--Kirillov (GK) dimension of simple highest weight modules for basic classical Lie superalgebras. Building upon the results for classical Lie algebras via Lusztig's {\bf a}-function and the Robinson--Schensted (RS) insertion algorithm, we extend these techniques to the super setting, providing explicit formulas for types $\mathfrak{sl}(m|n)$ and $\mathfrak{osp}(2|2n)$. Our results show that the GK dimension of a simple highest weight module is determined entirely by the even part of the Lie superalgebras.

Let $q$ be a prime power and write $\Omega$ for the bigraded algebra of regular differential forms over $\mathbb{F}_q^n$. The general linear group $GL_n(\mathbb{F}_q)$ acts on $\Omega$; write $SI \subseteq \Omega$ for the ideal generated by $GL_n(\mathbb{F}_q)$-invariants with vanishing constant term. The {\em $GL_n(\mathbb{F}_q)$-superspace coinvariant ring} is the quotient $SR:= \Omega/SI$. We calculate the bigraded Hilbert series of $SR$ and give an operator-theoretic characterization of the inverse system $SI^\perp$. Our results extend to subgroups $G$ of $GL_n(\mathbb{F}_q)$ which contain $SL_n(\mathbb{F}_q)$.

Let $G$ be a graph with $p(G)$ pendant vertices and $q(G)$ quasi-pendant vertices. Denote by $m_{L(G)}(\lambda)$ the multiplicity of $\lambda$ as a Laplacian eigenvalue of $G$. A graph $G$ is called reduced, if $p(G)=q(G)$. It is known that deleting a pendant path $P_3$ from a graph $G$ cannot change $m_{L(G)}(1)$. By the reduction operation for a graph (defined by Tian and Wong, 2026), we could turn to the reduced graphs with each quasi-pendant vertex of degree 2 to investigate $m_{L(G)}(1)$. Then let $T$ be a reduced tree on $n(\geq 7)$ vertices with each quasi-pendant vertex of degree 2 and without pendant path $P_3$. We first prove that \begin{equation*} m_{L(T)}(1)\leq \frac{n-5}{6} \end{equation*} and the extremal trees attaining the upper bound are determined completely. In addition, let $G$ be an arbitrary connected reduced graph with order $n\geq 6$ and size $m$. Denote by $c=m-n+1$ the first Betti number of $G$, then we obtain \begin{equation*} m_{L(G)}(1)\leq c+\frac{n-2}{4}, \end{equation*} and the extremal graphs attaining the upper bound are characterized completely.

An $n$-partite graph is a graph such that every vertex has a color in $\{1,\ldots,n\}$ and every two vertices of the same color are not adjacent. We study the model comparisons of the theories of $n$-partite graph and $K_{\overline{m}}$-free $n$-partite graph, where $K_{\overline{m}}$ is a complete graph of a given size. The model companion of the theory of $n$-partite graph is simple and has IP. The model companion of the theory of $K_{\overline{m}}$-free $n$-partite graph has $\operatorname{TP}_2$, $\operatorname{SOP}_3$ and $\operatorname{NSOP}_4$ if $n > 2$. Forking independence coincides with dividing independence in this theory.

In this paper, we develop a generalized differentiation theory at infinity for convex sets and functions. In particular, we study several fundamental notions of convex analysis at infinity, including tangent cones, normal cones, and subdifferentials. Our work complements the recently developed theories of nonsmooth analysis at infinity by focusing on the convex setting, where these constructions preserve convexity and admit natural connections with recession analysis, polarity, and epigraphical geometry. We show that, in the convex case, many results can be established under weaker assumptions and admit simpler and more explicit representations than those available in the general nonsmooth framework. In addition, we develop calculus rules and geometric characterizations for these constructions and apply them to optimality conditions and attainment criteria for convex optimization problems over unbounded feasible sets. The results obtained in this paper provide new tools for the study of convex sets and functions at infinity and further strengthen the connections between convex analysis, variational analysis, and optimization.

We give a dynamical proof of Benoist's non-arithmeticity theorem for Jordan spectra of Zariski dense subgroups of connected semisimple real algebraic groups. After passing to a Zariski dense Schottky subgroup, we use the coding of the limit set to realize Jordan projections as periods of a vector-valued Busemann return map for an expanding map on the Furstenberg boundary. The key step is to prove that a suitable two-branch asymptotic discrepancy is not locally constant on the limit set. We also show that the same criterion applies beyond Lie groups; in particular, it yields a direct density result for multiplier spectra of hyperbolic rational maps whose Julia set is not contained in a circle.

We present a novel method for solving conditional value-at-risk (CVaR) optimization problems based on the dual representation of CVaR, which is defined as the worst-case expectation over a risk envelope. The method is based on the Bregman proximal point algorithm and alternates between stochastic primal and dual stages. Every (inner) primal stage involves a subproblem solved by sampling from a probability distribution updated at each dual stage (outer iteration). The likelihood ratio of the dual probability distributions relative to the distribution underlying the original problem converges to the risk identifier of the solution's CVaR. Thus, the dual distribution provides the algorithm with a built-in importance sampling mechanism that draws from the tail of the underlying distribution. Because only samples in the tail influence the CVaR, and samples outside the tail are drawn with decreasing probability, the algorithm delivers exceptional performance over other stochastic approximation methods. We prove the convergence of the algorithm for convex objective functions. Our numerical experiments target representative problems in financial mathematics and machine learning, focusing on portfolio optimization and support-vector machines, respectively.

We investigate the Schrödinger bridge problem on a finite state space with a strictly positive Markov reference kernel. Starting from the semi-dual convex formulation, we introduce a continuous-time evolution for the terminal Schrödinger potential and show that its equilibria coincide with the unique solution of the bridge problem. The proposed dynamics induces an evolution for the terminal marginal. This marginal equation is governed by a state-dependent nonlocal Onsager operator, identified with the Hessian of the semi-dual functional. We derive its associated Dirichlet form, establish coercivity estimates on the appropriate quotient space, and interpret the resulting equation as a nonlocal gradient-flow formulation of relative entropy. Under natural positivity assumptions, we prove global well-posedness of the SBOF, convergence to the Schrödinger bridge, convergence of the induced couplings and path measures, and exponential relaxation of the terminal marginal. The latter follows from a uniform Poincaré inequality on compact sublevel sets together with entropy--variance comparison estimates. We also discuss the connection with finite-state generative modeling through the Doob transform and illustrate the theory on finite-grid examples involving rare states.

We study a critical multitype Bellman--Harris branching particle system in $\mathbb R^N$ with a finite type space $\mathbb K=\{1,\dots,K\}$. Particles of type $i$ move according to a symmetric $\alpha_i$-stable process and reproduce according to a critical offspring law whose mean matrix is irreducible and stochastic. The lifetime distribution of type $1$ is assumed to have infinite mean with regularly varying tail $$ 1-F_1(t)\sim c_1t^{-\gamma},\, 0<\gamma<1, $$ whereas the remaining lifetime distributions satisfy polynomial upper-tail bounds $$ \overline F_i(t)\le C t^{-\eta_i},\, i=2,\dots,K, \, \eta_i>1, \, \eta:=\min_{2\le i\le K}\eta_i. $$ The branching mechanism is assumed to be in the domain of attraction of a $(1+\beta)$-stable law, with $\beta\in(0,1]$. Under the space--lifetime condition $$ \rho:=\left(\eta-1\right)\wedge\frac{N}{\alpha_1} > \frac{\gamma}{\beta}, $$ and a local increment condition on the heavy lifetime distribution, we prove convergence of the system to a Poisson random measure concentrated on the infinite-mean type.

We consider the classical $N$-body problem with the $\frac{1}{|x|^p}$-type potential, where $p>0$. We construct hyperbolic, parabolic and hyperbolic-parabolic solutions with prescribed asymptotic data as $t \to+\infty$.

We consider independent Bernoulli percolation on top of sequences of hierarchical graphs. Given a graph $G_{1}$ with two distinguished vertices $a_{1}$ and $b_{1}$, the hierarchical graph with seed $G_{1}$ is the sequence $\big( G_{k} \big)_{k \geq 1}$ resulting from the inductive procedure, where the graph $G_{k+1}$ is obtained from $G_{k}$ by replacing each of its edges with a copy of $G_{1}$, attached by the vertices $a_{1}$ and $b_{1}$. We prove that, under sharp hypotheses, percolation on these graphs presents a unique phase transition. Second, we establish the existence of several critical exponents in this context, such as the critical exponents for the correlation length $\nu$, the surface tension $\mu$, the one-arm exponent $\alpha_{1}$. Several results are also obtained for their infinite counterpart $G_\infty$, which is the Benjamini-Schramm limit of $G_k$: uniqueness of the infinite cluster, continuity of $\theta(p)$, existence of the percolation-probability exponent $\beta$ and scaling relations for the critical exponents $\alpha_1$, $\nu$ and $\beta$. Furthermore, we analyze noise sensitivity for crossing functions in $G_{k}$ and establish sharp noise sensitivity in this setting. Finally, we propose a setup where it is possible to verify the locality hypothesis, stating that the critical threshold for percolation is a local property, while critical exponents are determined by the global geometry of the graph. As a consequence of the techniques developed here, we also provide a necessary and sufficient condition for the existence of a unique fixed point for the map $p \mapsto \mathbb{E}_p[g]$ in $(0,1)$, where $g:\{0,1\}^n \to \{0,1\}$ is a nontrivial monotone Boolean function.

We investigate a free boundary PDE model for vascularized tumor growth with two time-periodic coefficients representing nutrient supply $\phi(t)$ and nutrient demand $\psi(t)$. Under radial symmetry, the model reduces to a nonautonomous ODE for the tumor radius. We prove a vanishing-persistence dichotomy governed by the averaged coefficients $\bar{\phi}$ and $\bar{\psi}$: if the average nutrient supply does not exceed the average nutrient demand, namely $\bar{\phi}\le \bar{\psi}$, the tumor radius tends to zero; if the average supply exceeds the average demand, namely $\bar{\phi}>\bar{\psi}$, the tumor persists and converges to a unique positive periodic solution. We also study the linear stability of this periodic solution when nonradial perturbations are imposed. Under a stronger condition on the nutrient supply and demand, we show that the radially symmetric periodic solution is linearly stable when the tumor aggressiveness parameter is sufficiently small. Numerical simulations are provided to illustrate the analytical results.

We continue to study ultrametric spaces as two-sorted structures consisting of a set of points and of a linearly ordered set of distances, together with the dc-embeddings, which we introduced in our earlier paper "Universal homogeneous two-sorted ultrametric spaces". The class of all finite two-sorted ultrametric spaces with dc-embeddings is Fraïssé whose limit we denote by $\mathbb{U}$. The main result of the article is that $\operatorname{Aut}(\mathbb{U})$ has a comeager conjugacy class. For that we show the cofinal amalgamation property of partial automorphisms and characterize amalgamation bases. In fact we develop a general strategy for showing cofinal amalgamation property for a broad class of categories. Furthermore, we show that there is no generic pair of automorphisms, we provide a detailed description of single orbits under dc-automorphisms, and we prove that any finite partial dc-automorphism, even in the presence of other orbits, can be extended to one that is closed or monotone.

We study the graded polynomial identities of the first Weyl algebra $W_1$ over an infinite field. The algebra $W_1$ satisfies no ordinary polynomial identities in characteristic 0. It admits a natural grading by the infinite cyclic group $\mathbb{Z}$. We construct a basis of the $\mathbb{Z}$-graded identities of $W_1$, which consists of a single identity. It expresses the fact that the degree 0 component in the grading is commutative. It is also well known that if the characteristic of the base field is $p>2$, then $W_1$ satisfies the same identities as the full matrix algebra of order $p$. In this situation, we describe the $\mathbb{Z}_p$-graded identities of $W_1$. Afterwards, using various combinatorial and algebraic tools we consider graded identities for various types of algebras generalizing the Weyl algebras. For example, we show that $\mathbb{Z}$-graded Galois rings in characteristic 0 satisfy the same graded identities as $W_1$ when they embed in a shift operator algebra $\mathcal{S}_1$, and as a consequence we obtain that these $\mathbb{Z}$-graded Galois rings are not PI. The same holds for the algebra of differential operators on $1$-dimensional torus. We obtain similar results for generalized Weyl algebras. We also deal with the graded identities for the quantum Weyl algebras and for the quantum plane. It turns out that in the latter case and when $q$ is the $\ell$-th primitive root of unity, one is led to study gradings by the group $\mathbb{Z}_\ell\times \mathbb{Z}_\ell$. In this case the quantum plane satisfies the same graded identities as the matrix algebra of order $\ell$. Finally we construct a natural $\mathbb{Z}$-grading on the universal enveloping algebra of $\mathfrak{sl}_2$, and prove that its $\mathbb{Z}$-graded identities are the same as those of $W_1$, in characteristic $0$.