<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:sy="http://purl.org/rss/1.0/modules/syndication/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0">
  <channel>
    <title>Mathematics and Society</title>
    <link>https://math-sci.ui.ac.ir/</link>
    <description>Mathematics and Society</description>
    <atom:link href="" rel="self" type="application/rss+xml"/>
    <language>en</language>
    <sy:updatePeriod>daily</sy:updatePeriod>
    <sy:updateFrequency>1</sy:updateFrequency>
    <pubDate>Sun, 11 Jan 2026 00:00:00 +0330</pubDate>
    <lastBuildDate>Sun, 11 Jan 2026 00:00:00 +0330</lastBuildDate>
    <item>
      <title>Recognition of the group $E_{6}(5)$ by prime graph</title>
      <link>https://math-sci.ui.ac.ir/article_30163.html</link>
      <description>If \( n \) is an integer, the set of all prime divisors of \( n \) is denoted by \( \pi(n) \). Let \( G \) be a finite group. Then \( \pi(|G|) \) is denoted by \( \pi(G) \). The prime graph of \( G \), denoted by \( \Gamma(G) \), is constructed as follows: the vertex set is \( \pi(G) \), and two distinct primes \( p \) and \( q \) are connected by an edge if and only if \( G \) has an element of order \( pq \). A finite nonabelian simple group $P$ is called quasirecognizable by prime graph, if each finite group $G$ with $\Gamma(G) = \Gamma(P)$ has a unique composition factor isomorphic to $P$. We denote by $k(\Gamma(G))$ the number of isomorphism classes of finite groups $H$ satisfying $\Gamma(G)=\Gamma(H)$. Given a natural number $r$, a finite group $G$ is called $r$-recognizable by prime graph if $k(\Gamma(G))=r$ and if $k(\Gamma(G))=1$, is called recognizable . In this paper, as the main result, we show that if \( G \) is a finite group such that \( \Gamma(G) = \Gamma(E_6(5)) \), then \( G \cong E_6(5) \).</description>
    </item>
    <item>
      <title>Comparison Theorems and Their Applications on Riemannian Manifolds with Ricci Curvature Bounds</title>
      <link>https://math-sci.ui.ac.ir/article_30273.html</link>
      <description>In this paper, we study comparison theorems for a Riemannian manifold $&amp;amp;lrm;M^n&amp;amp;lrm;$ under a lower bound condition on the Ricci curvature involving vector fields and gradient vector fields. We first establish Laplacian and volume comparison theorems for Riemannian manifolds endowed with a modified Ricci curvature as follow&amp;amp;lrm;\begin{align}\nonumber&amp;amp;lrm;&amp;amp;lrm;\tilde{Ric}:= Ric&amp;amp;lrm; + &amp;amp;lrm;\frac{1}{2}\mathcal{L}_{V}g \geq (n-1)k,&amp;amp;lrm;\end{align}&amp;amp;lrm;and then for manifolds satisfying the Bakry&amp;amp;ndash;&amp;amp;Eacute;mery Ricci curvature condition as follow&amp;amp;lrm;\begin{equation}&amp;amp;lrm;\nonumber&amp;amp;lrm;&amp;amp;lrm;Ric+Hess h\geq (n-1)k&amp;amp;lrm;,&amp;amp;lrm;&amp;amp;rlm;&amp;amp;lrm;\end{equation}for some smooth function $&amp;amp;lrm;h&amp;amp;lrm;$&amp;amp;lrm;&amp;amp;rlm;&amp;amp;lrm;&amp;amp;rlm;&amp;amp;rlm;&amp;amp;rlm;. Furthermore, we show that these comparison theorems remain valid, in particular, for the shrinking, steady, and expanding gradient Ricci solitons under the non-collapsing volume condition, and even without this condition when the soliton potential function is bounded. Consequently, we extend all of these results to almost Ricci solitons and gradient almost Ricci solitons. By using the obtained comparison results, we also derive a segment inequality for Riemannian manifolds $&amp;amp;lrm;M^n&amp;amp;lrm;$ with bounded Ricci curvature.</description>
    </item>
    <item>
      <title>Dynamical  systems with stable statistical  behavior</title>
      <link>https://math-sci.ui.ac.ir/article_30366.html</link>
      <description>In this paper, a new class of maps on the two-dimensional torus $\mathbb{T}^2$ is introduced that are not uniformly expanding and have no type of dominated splitting; nevertheless, we show that these maps stably possess a finite number of absolutely continuous invariant probability measures (ACIP) with respect to Lebesgue measure. The proof is based on the concept of "virtually expanding", recently introduced by Tsujii. Our method provides a framework for explicitly constructing these examples. To find new examples, we use a geometric interpretation of the virtually expanding property. This geometric perspective allows us to provide a sufficient condition for an endomorphism to be virtually expanding. The construction of this category of examples is based on a precise perturbation and surgery. These perturbations are supported on a small ball. In fact, by using the bump function technique, we change a linear endomorphism near a fixed point and replace its derivative with a suitably chosen matrix. This perturbation is designed in such a way that it preserves the virtual expanding property but eliminates any dominant splitting.</description>
    </item>
    <item>
      <title>Ergodic theorems for a sequence of mappings in Banach spaces</title>
      <link>https://math-sci.ui.ac.ir/article_30490.html</link>
      <description>In this paper, ergodic convergence for a sequence of nonexpansive mappings in uniformly convex and uniformly smooth Banach spaces is studied. By introducing another definition of an almost orbit, an attempt is made to replace the uniform convergence condition with a weaker one. Our results provide a generalization of some classical ergodic convergence theorems for nonexpansive mappings.</description>
    </item>
    <item>
      <title>From classical filters to convolutional neural networks: the mathematical foundations and evolution of neural style transfer in images</title>
      <link>https://math-sci.ui.ac.ir/article_30519.html</link>
      <description>Neural Style Transfer (NST) stands as a remarkable example of the synthesis of mathematics, statistics, deep learning, and art. In this article, we present a historical and analytical exploration of the mathematical evolution of image-processing tools---from classical and derivative-based filters to frequency-domain transforms and multiscale representations---and trace how these concepts ultimately paved the way for convolutional neural networks, which form the foundation for understanding style transfer. We show how these mathematical developments culminated in the formulation of the NST algorithm. We then examine the mathematical structure of style transfer with a focus on the role of Gram matrices, learned feature spaces, and the optimization-based objective function. A central insight of NST is that its loss function becomes meaningful only through the representational power of deep neural networks: the notions of ``style'' and ``content'' are defined in learned feature spaces rather than in pixel space. Grounded in statistical concepts and solved through classical optimization methods, this formulation illustrates the deep and elegant interplay between applied mathematics, statistics, and deep learning in creating an artistic computational technique.</description>
    </item>
    <item>
      <title>Homomorphisms and decompositions in finite generalized groups</title>
      <link>https://math-sci.ui.ac.ir/article_30528.html</link>
      <description>This paper presents a comprehensive analysis of the interaction between homomorphisms and decomposition theorems in finite generalized groups. By synthesizing the theory of homomorphisms and external structures with decomposition theorems, we obtain new results about the structure of finite strongly normal generalized groups. We introduce the concept of homomorphic decomposition and prove that every finite strongly normal generalized group can be decomposed into the direct product of its image under a homomorphism and a kernel structure. We also establish conditions under which the decomposition preserves homomorphic properties. Our results provide a unified framework for understanding the structure of finite generalized groups and their homomorphisms.&#13;
\end{abstract}</description>
    </item>
  </channel>
</rss>
