arXiv Math @arxiv_math@qoto.org

In this paper, we will use the entropy approach to derive a necessary and sufficient condition for the existence of an element that belongs to at least half of the sets in a finite family of sets.

A set $S\subseteq V$ in an isolate-free graph $G$ is a total restrained dominating set, abbreviated TRD-set, if every vertex in $V$ is adjacent to a vertex in $S$, and every vertex in $V\setminus S$ is adjacent to a vertex in $V\setminus S$. A total restrained coalition is made up of two disjoint sets of vertices $X$ and $Y$ of $G$, neither of which is a TRD-set but their union $X\cup Y$ is a TRD-set. A total restrained coalition partition of a graph $G$ is a partition $Φ=\{V_1, V_2,\dots,V_k\}$ such that for all $i \in [k]$, the set $V_i$ forms a total restrained coalition with another set $V_j$ for some $j$, where $j\in [k]\setminus{i}$. The total restrained coalition number $C_{tr}(G)$ in $G$ equals the maximum order of a total restrained coalition partition in $G$. In this work, we initiate the study of total restrained coalition in graphs and its properties.

Let $Ab_0$ be the class of finite abelian groups and consider the function $f:Ab_0\longrightarrow(0,\infty)$ given by $f(G)=\frac{|{\rm Aut}(G)|}{|G|}$\,, where ${\rm Aut}(G)$ is the automorphism group of a finite abelian group $G$. In this short note, we prove that the image of $f$ is a dense set in $[0,\infty)$.

Let $p\in (1,\infty)$ and let $G$ be a discrete group. G. An, J.-J. Lee and Z.-J. Ruan introduced $p$-nuclearity for $L^p$-operator algebras. They proved that the reduced group $L^p$-operator algebra $F^p_λ(G)$ is $p$-nuclear if $G$ is amenable. In this paper, we show that the converse is true. This answers an open problem concerning the $p$-nuclearity for reduced group $L^p$-operator algebras of N. C. Phillips.

We prove a sufficient condition for a \emph{pattern} $π$ on a \emph{triod} $T$ to have \emph{rotation number} $ρ_π$ coincide with an end-point of its \emph{forced rotation interval} $I_π$. Then, we demonstrate the existence of peculiar \emph{patterns} on \emph{triods} that are neither \emph{triod twists} nor possess a \emph{block structure} over a \emph{triod twist pattern}, but their \emph{rotation numbers} are an end point of their respective \emph{forced rotation intervals}, mimicking the behavior of \emph{triod twist patterns}. These \emph{patterns}, absent in circle maps (see \cite{almBB}), highlight a key difference between the rotation theories for \emph{triods} (introduced in \cite{BMR}) and that of circle maps. We name these \emph{patterns}: ``\emph{strangely ordered}" and show that they are semi-conjugate to circle rotations via a piece-wise monotone map. We conclude by providing an algorithm to construct unimodal \emph{strangely ordered patterns} with arbitrary \emph{rotation pairs}.

We consider the asymptotics of orthogonal polynomials for measures that are differentiable, but not necessarily analytic, multiplicative perturbations of Jacobi-like measures supported on disjoint intervals. We analyze the Fokas--Its--Kitaev Riemann--Hilbert problem using the Deift--Zhou method of nonlinear steepest descent and its $\overline \partial$ extension due to Miller and McLaughlin. Our results extend that of Yattselev in the case of Chebyshev-like measures with error bounds that are slightly improved while less regular perturbations are admissible. For the general Jacobi-like case, we present, what appears to be the first result for asymptotics when the perturbation of the measure is only assumed to be twice differentiable, with bounded third derivative.

We identify all non-splitting bi-unitary perfect polynomials over the field $\mathbb{F}_4$, which admit at most four irreducible divisors. There is an infinite number of such divisors.

In this article, we prove for any finite coloring of $\mathbb{N}$, there exists $a,b$ such that $\{a,b, ab,(a+1)b\}$ is monochromatic. This disproves a conjecture of J. Sahasrabudhe.

If the circle acts in a Hamiltonian way on a compact symplectic manifold of dimension $2n$, then there are at least $n+1$ fixed points. The case that there are exactly $n+1$ isolated fixed points has its importance due to various reasons. Besides dimension 2 with 2 fixed points, and dimension 4 with 3 fixed points, which are known, the next interesting case is dimension 6 with 4 fixed points, for which the integral cohomology ring and the total Chern class of the manifold, and the sets of weights of the circle action at the fixed points are classified by Tolman. In this note, we use a new different argument to prove Tolman's results for the dimension 6 with 4 fixed points case. We observe that the integral cohomology ring of the manifold has a nice basis in terms of the moment map values of the fixed points, and the largest weight between two fixed points is nicely related to the first Chern class of the manifold. We will use these ingredients to determine the sets of weights of the circle action at the fixed points, and moreover to determine the global invariants the integral cohomology ring and total Chern class of the manifold. The idea allows a direct approach of the problem, and the argument is short and easy to follow.

The greatest integer that does not belong to a numerical semigroup $S$ is called the Frobenius number of $S$, and finding the Frobenius number is called the Frobenius problem. In this paper, we solve the Frobenius problem for Binomial Coefficients.

In this paper, we consider the following Hardy-type mean field equation \[ \left\{ {\begin{array}{*{20}{c}} { - Δu-\frac{1}{(1-|x|^2)^2} u = λe^u}, & {\rm in} \ \ B_1, {\ \ \ \ u = 0,} &\ {\rm on}\ \partial B_1, \end{array}} \right. \] \[\] where $λ>0$ is small and $B_1$ is the standard unit disc of $\mathbb{R}^2$. Applying the moving plane method of hyperbolic space and the accurate expansion of heat kernel on hyperbolic space, we establish the radial symmetry and Brezis-Merle lemma for solutions of Hardy-type mean field equation. Meanwhile, we also derive the quantitative results for solutions of Hardy-type mean field equation, which improves significantly the compactness results for classical mean-field equation obtained by Brezis-Merle and Li-Shafrir. Furthermore, applying the local Pohozaev identity from scaling, blow-up analysis and a contradiction argument, we prove that the solutions are unique when $λ$ is sufficiently close to 0.

We consider a neural network architecture designed to solve inverse problems where the degradation operator is linear and known. This architecture is constructed by unrolling a forward-backward algorithm derived from the minimization of an objective function that combines a data-fidelity term, a Tikhonov-type regularization term, and a potentially nonsmooth convex penalty. The robustness of this inversion method to input perturbations is analyzed theoretically. Ensuring robustness complies with the principles of inverse problem theory, as it ensures both the continuity of the inversion method and the resilience to small noise - a critical property given the known vulnerability of deep neural networks to adversarial perturbations. A key novelty of our work lies in examining the robustness of the proposed network to perturbations in its bias, which represents the observed data in the inverse problem. Additionally, we provide numerical illustrations of the analytical Lipschitz bounds derived in our analysis.

Let $Φ=(G,U(\mathbb{Q}),φ)$ be a quaternion unit gain graph (or $U(\mathbb{Q})$-gain graph). The adjacency matrix of $Φ$ is denoted by $A(Φ)$ and the left row rank of $Φ$ is denoted by $r(Φ)$. If $Φ$ has at least one cycle, then the length of the shortest cycle in $Φ$ is the girth of $Φ$, denoted by $g$. In this paper, we prove that $r(Φ)\geq g-2$ for $Φ$. Moreover, we characterize $U(\mathbb{Q})$-gain graphs satisfy $r(Φ)=g-i$ ($i=0,1,2$) and all quaternion unit gain graphs with rank 2. The results will generalize the corresponding results of simple graphs (Zhou et al. Linear Algebra Appl. (2021), Duan et al. Linear Algebra Appl. (2024) and Duan, Discrete Math. (2024)), signed graphs (Wu et al. Linear Algebra Appl. (2022)), and complex unit gain graphs (Khan, Linear Algebra Appl. (2024)).

The number of Nash equilibria of the mixed extension of a generic finite game in normal form is finite and odd. This raises the question how large the number can be, depending on the number of players and the numbers of their pure strategies. Here we present a lower bound for the maximal possible number in the case of m-player games where each player has two pure strategies. It is surprisingly close to a known upper bound.

The Gibbs sampler, also known as the coordinate hit-and-run algorithm, is a Markov chain that is widely used to draw samples from probability distributions in arbitrary dimensions. At each iteration of the algorithm, a randomly selected coordinate is resampled from the distribution that results from conditioning on all the other coordinates. We study the behavior of the Gibbs sampler on the class of log-smooth and strongly log-concave target distributions supported on $\mathbb{R}^n$. Assuming the initial distribution is $M$-warm with respect to the target, we show that the Gibbs sampler requires at most $O^{\star}\left(κ^2 n^{7.5}\left(\max\left\{1,\sqrt{\frac{1}{n}\log \frac{2M}γ}\right\}\right)^2\right)$ steps to produce a sample with error no more than $γ$ in total variation distance from a distribution with condition number $κ$.

We introduce nonabelian analogs of shift operators in the enumerative theory of quasimaps. We apply them on the one hand to strengthen the emerging analogy between enumerative geometry and the geometric theory of automorphic forms, and on the other hand to obtain results about quantized Coulomb branch algebras. In particular, we find a short and direct proof that the equivariant convolution homology of the affine Grassmannian of $GL_n$ is a quotient of a shifted Yangian.

In symplectic topology one uses elliptic methods to prove rigidity results about symplectic manifolds and solutions of Hamiltonian equations on them, where the most basic example is given by geodesics on Riemannian manifolds. Harmonic maps from surfaces are the natural 2-dimensional generalizations of geodesics. In this paper, we give the corresponding generalization of symplectic manifolds and Hamiltonian equations, leading to a class of partial differential equations that share properties similar to Hamiltonian (ordinary) differential equations. Two rigidity results are discussed: a non-squeezing theorem and a version of the cuplength result for quadratic Hamiltonians on cotangent bundles. The proof of the latter uses a generalization of Floer curves, for which the necessary Fredholm and compactness results will be proven.

In this work, we present three important theorems related to the corrected Smagorinsky model for turbulence in time-dependent domains. The first theorem establishes an improved regularity criterion for the solution of the corrected Smagorinsky model in Sobolev spaces $H^s(Ω(t))$ with smooth and evolving boundaries. The result provides a bound on the Sobolev norm of the solution, ensuring that the solution remains regular over time. The second theorem quantifies the approximation error between the corrected Smagorinsky model and the true Navier-Stokes solution. Taking advantage of high-order Sobolev spaces and energy methods, we derive an explicit error estimate for the velocity fields, showing the relationship between the error and the external force term. The third theorem focuses on the asymptotic convergence of the corrected Smagorinsky model to the solution of the Navier-Stokes equations as time progresses. We provide an upper bound for the error in the $L^2(Ω)$ norm, demonstrating that the error decreases as time increases, especially as the external force term vanishes. This result highlights the long-term convergence of the corrected model to the true solution, with explicit dependences on the initial conditions, viscosity, and external forces.

This is mainly a small exposition on extensions of valuation rings