Results 71 to 80 of about 22,120 (235)
Where Mathematical Symbols Come From
Abstract There is a sense in which the symbols used in mathematical expressions and formulas are arbitrary. After all, arithmetic would be no different if we would replace the symbols ‘+$+$’ or ‘8’ by different symbols. Nevertheless, the shape of many mathematical symbols is in fact well motivated in practice.
Dirk Schlimm
wiley +1 more source
A note on the zero divisor graph of a lattice [PDF]
Let $L$ be a lattice with the least element $0$. An element $xin L$ is a zero divisor if $xwedge y=0$ for some $yin L^*=Lsetminus left{0right}$. The set of all zero divisors is denoted by $Z(L)$.
T. Tamizh Chelvam , S. Nithya
doaj
Coloured shuffle compatibility, Hadamard products, and ask zeta functions
Abstract We devise an explicit method for computing combinatorial formulae for Hadamard products of certain rational generating functions. The latter arise naturally when studying so‐called ask zeta functions of direct sums of modules of matrices or class‐ and orbit‐counting zeta functions of direct products of nilpotent groups.
Angela Carnevale+2 more
wiley +1 more source
On the finiteness of maps into simple abelian varieties satisfying certain tangency conditions
Abstract We show that given a simple abelian variety A$A$ and a normal variety V$V$ defined over a finitely generated field K$K$ of characteristic zero, the set of non‐constant morphisms V→A$V \rightarrow A$ satisfying certain tangency conditions imposed by a Campana orbifold divisor Δ$\Delta$ on A$A$ is finite.
Finn Bartsch
wiley +1 more source
Exploring the properties of the zero-divisor graph of direct product of $\ast$-rings [PDF]
In this paper, we delve into the study of zero-divisor graphs in rings equipped with an involution. Specifically, we focus on abelian Rickart $\ast$-rings.
Mohd Nazim+2 more
doaj +1 more source
ABSTRACT Integer and modular arithmetic is a fundamental area of mathematics, with extensive applications in computer science, and is essential for cryptographic protocols, error correction, and algorithm efficiency. However, students often struggle to understand its abstract nature, especially when transitioning from theoretical knowledge to practical
Violeta Migallón+2 more
wiley +1 more source
The field of mathematics that studies the relationship between algebraic structures and graphs is known as algebraic graph theory. It incorporates concepts from graph theory, which examines the characteristics and topology of graphs, with those from ...
Amal S. Alali+5 more
doaj +1 more source
Moduli of finite flat torsors over nodal curves
Abstract We show that log flat torsors over a family X/S$X/S$ of nodal curves under a finite flat commutative group scheme G/S$G/S$ are classified by maps from the Cartier dual of G$G$ to the log Jacobian of X$X$. We deduce that fppf torsors on the smooth fiberss of X/S$X/S$ can be extended to global log flat torsors under some regularity hypotheses.
Sara Mehidi, Thibault Poiret
wiley +1 more source
Groups with triangle‐free graphs on p$p$‐regular classes
Abstract Let p$p$ be a prime. In this paper, we classify the p$p$‐structure of those finite p$p$‐separable groups such that, given any three non‐central conjugacy classes of p$p$‐regular elements, two of them necessarily have coprime lengths.
M. J. Felipe+2 more
wiley +1 more source
Suppose that the zero-divisor graph of a commutative semi-group S, be a complete graph with an end vertex. In this paper, we determine the structure of the annihilator graph S and we show that if Z(S)= S, then the annihilator graph S is a disconnected ...
Sakhdari Seyed Mohammad, Afkhami Mojgan
doaj +1 more source