Let f(x) and g(x) be polynomials in $\mathbb F_{2}[x]$ with ${\rm deg}\text{ } f=n$. It is shown that for $n\gg 1$, there is an $g_{1}(x)\in \mathbb F_{2}[x]$ with ${\rm deg}\text{ } g_{1}\leqslant \max\{{\rm deg}\text{ } g, 6.7\log n\}$ and $g(x)-g_{1}(x)$ having $ \lt 6.7\log n$ terms such that $\gcd(f(x), g_{1}(x))=1$. As an application, it is established using a result of Dubickas and Sha that given $f(x)\in \mathbb F_{2}[x]$ of degree $n\geqslant 1$, there is a separable $g(x)\in 2[x]$ with ${\rm deg}\text{ } g= {\rm deg}\text{ } f$ and satisfying that $f(x)-g(x)$ has $\leqslant 6.7\log n$ terms. As a simple consequence, the latter result holds in $\mathbb Z[x]$ after replacing ‘number of terms’ by the L1-norm of a polynomial and $6.7\log n$ by $6.8\log n$. This improves the bound $(\log n)^{\log 4 +\operatorname{\varepsilon}}$ obtained by Filaseta and Moy.

Let G be a finite solvable group. We prove that if $\chi\in{{\operatorname{Irr}}}(G)$ has odd degree and $\chi(1)$ is the minimal degree of the nonlinear irreducible characters of G, then $G/\operatorname{Ker}\chi$ is nilpotent-by-abelian.

This article studies the dynamical behaviour of classical solutions of a hyperbolic system of balance laws, derived from a chemotaxis model with logarithmic sensitivity, with time-dependent boundary conditions. It is shown that under suitable assumptions on the boundary data, solutions starting in the $H^2$-space exist globally in time and the differences between the solutions and their corresponding boundary data converge to zero as time goes to infinity. There is no smallness restriction on the magnitude of the initial perturbations. Moreover, numerical simulations show that the assumptions on the boundary data are necessary for the above-mentioned results to hold true. In addition, numerical results indicate that the solutions converge asymptotically to time-periodic states if the boundary data are time-periodic.

Let $(A,\mathfrak{m})$ be a Cohen–Macaulay local ring, and then the notion of a $T$-split sequence was introduced in the part-1 of this paper for the $\mathfrak{m}$-adic filtration with the help of the numerical function $e^T_A$. In this article, we explore the relation between Auslander–Reiten (AR)-sequences and $T$-split sequences. For a Gorenstein ring $(A,\mathfrak{m})$, we define a Hom-finite Krull–Remak–Schmidt category $\mathcal{D}_A$ as a quotient of the stable category $\underline{\mathrm{CM}}(A)$. This category preserves isomorphism, that is, $M\cong N$ in $\mathcal{D}_A$ if and only if $M\cong N$ in $\underline{\mathrm{CM}}(A)$.This article has two objectives: first objective is to extend the notion of $T$-split sequences, and second objective is to explore the function $e^T_A$ and $T$-split sequences. When $(A,\mathfrak{m})$ is an analytically unramified Cohen–Macaulay local ring and $I$ is an $\mathfrak{m}$-primary ideal, then we extend the techniques in part-1 of this paper to the integral closure filtration with respect to $I$ and prove a version of Brauer–Thrall-II for a class of such rings.

This paper studies the spatio-temporal dynamics of a diffusive plant-sulphide model with toxicity delay. More specifically, the effects of discrete delay and distributed delay on the dynamics are explored, respectively. The deep analysis of eigenvalues indicates that both diffusion and delay can induce Hopf bifurcations. The normal form theory is used to set up an exact formula that determines the properties of Hopf bifurcation in a diffusive plant-sulphide model. A sufficiently small discrete delay does not affect the stability and a sufficiently large discrete delay destabilizes the system. Nonetheless, a sufficiently small or large distributed delay does not affect the stability. Both delays cause instability by inducing Hopf bifurcation rather than Turing bifurcation.

We study the Cauchy problem on the real line for the nonlocal Fisher-KPP equation in one spatial dimension,

\begin{equation*} u_t = D u_{xx} + u(1-\phi *u), \end{equation*}

$\phi *u$

$\phi (y) \equiv H\left (\frac{1}{4}-y^2\right )$

$u=1$

$D$

$\Delta _1 \approx 0.00297$

$D \ll 1$

$O(1)$

$u=O(1)$

$u$

$D \to 0^+$

$D \geq \Delta _1$

$2 \sqrt{D}$

$0 \lt D \lt \Delta _1$

$u=0$

$D$

A wake model is pursued for potential flow past a submerged, finite-length plate that is perpendicular to a uniform, horizontal stream bounded above by a free surface. The effects of gravity are included along the free surface. The approach is to adopt an open-wake model such that the wake boundaries become parallel to the undisturbed stream at some (unknown) point downstream. Boundary integral equations are formed and then discretised along the wake boundaries and free surface in order to obtain a solution numerically. In terms of the dependency of the solution on various parameters, the problem will be formulated in two ways. First, for a given Froude number and ratio of the length of the vertical plate to the draft (the depth of the bottom of the vertical plate relative to the undisturbed free surface), the effect of the wake underpressure coefficient on the size of the wake will be considered. Then, the problem will be discussed where we instead (more naturally) fix the Froude number, draft and length of the vertical, submerged plate. The dependencies of the solution on these parameters will be analysed regarding the effects on several factors, including the size of the wake, the relative lengths of the upper and lower wake boundaries, and the resulting wake underpressure coefficient.

Let $(A,\mathfrak{m})$ be a regular local ring of dimension $d \geq 1$, I an $\mathfrak{m}$-primary ideal. Let N be a nonzero finitely generated A-module. Consider the functions

\begin{equation*}t^I(N, n) = \sum_{i = 0}^{d}\ell(\text{Tor}^A_i(N, A/I^n)) \ \text{and}\ e^I(N, n) = \sum_{i = 0}^{d}\ell(\text{Ext}_A^i(N, A/I^n))\end{equation*}

of polynomial type and let their degrees be $t^I(N) $ and $e^I(N)$. We prove that $t^I(N) = e^I(N) = \max\{\dim N, d -1 \}$. A crucial ingredient in the proof is that $D^b(A)_f$, the bounded derived category of A with finite length cohomology, has no proper thick subcategories.

We examine a cyclic order on the directed edges of a tree whose vertices have cyclically ordered links. We use it to show that a graph of groups with left-cyclically ordered vertex groups and convex left-ordered edge groups is left-cyclically orderable.

The walk matrix associated to an $n\times n$ integer matrix $\mathbf{X}$ and an integer vector $b$ is defined by ${\mathbf{W}} \,:\!=\, (b,{\mathbf{X}} b,\ldots, {\mathbf{X}}^{n-1}b)$. We study limiting laws for the cokernel of $\mathbf{W}$ in the scenario where $\mathbf{X}$ is a random matrix with independent entries and $b$ is deterministic. Our first main result provides a formula for the distribution of the $p^m$-torsion part of the cokernel, as a group, when $\mathbf{X}$ has independent entries from a specific distribution. The second main result relaxes the distributional assumption and concerns the ${\mathbb{Z}}[x]$-module structure.

The motivation for this work arises from an open problem in spectral graph theory, which asks to show that random graphs are often determined up to isomorphism by their (generalised) spectrum. Sufficient conditions for generalised spectral determinacy can, namely, be stated in terms of the cokernel of a walk matrix. Extensions of our results could potentially be used to determine how often those conditions are satisfied. Some remaining challenges for such extensions are outlined in the paper.

In this paper, we deal with a weighted eigenvalue problem for the anisotropic $(p,q)$-Laplacian with Dirichlet boundary conditions. We study the main properties of the first eigenvalue and a reverse Hölder type inequality for the corresponding eigenfunctions.

Given an $n\times n$ symmetric matrix $W\in [0,1]^{[n]\times [n]}$, let ${\mathcal G}(n,W)$ be the random graph obtained by independently including each edge $jk\in \binom{[n]}{2}$ with probability $W_{jk}=W_{kj}$. Given a degree sequence $\textbf{d}=(d_1,\ldots, d_n)$, let ${\mathcal G}(n,\textbf{d})$ denote a uniformly random graph with degree sequence $\textbf{d}$. We couple ${\mathcal G}(n,W)$ and ${\mathcal G}(n,\textbf{d})$ together so that asymptotically almost surely ${\mathcal G}(n,W)$ is a subgraph of ${\mathcal G}(n,\textbf{d})$, where $W$ is some function of $\textbf{d}$. Let $\Delta (\textbf{d})$ denote the maximum degree in $\textbf{d}$. Our coupling result is optimal when $\Delta (\textbf{d})^2\ll \|\textbf{d}\|_1$, that is, $W_{ij}$ is asymptotic to ${\mathbb P}(ij\in{\mathcal G}(n,\textbf{d}))$ for every $i,j\in [n]$. We also have coupling results for $\textbf{d}$ that are not constrained by the condition $\Delta (\textbf{d})^2\ll \|\textbf{d}\|_1$. For such $\textbf{d}$ our coupling result is still close to optimal, in the sense that $W_{ij}$ is asymptotic to ${\mathbb P}(ij\in{\mathcal G}(n,\textbf{d}))$ for most pairs $ij\in \binom{[n]}{2}$.

We study computational aspects of repulsive Gibbs point processes, which are probabilistic models of interacting particles in a finite-volume region of space. We introduce an approach for reducing a Gibbs point process to the hard-core model, a well-studied discrete spin system. Given an instance of such a point process, our reduction generates a random graph drawn from a natural geometric model. We show that the partition function of a hard-core model on graphs generated by the geometric model concentrates around the partition function of the Gibbs point process. Our reduction allows us to use a broad range of algorithms developed for the hard-core model to sample from the Gibbs point process and approximate its partition function. This is, to the extent of our knowledge, the first approach that deals with pair potentials of unbounded range.