相关论文: A new and simpler noncommutative central sets theo…
Molodstov[10] introduced soft set theory as a new mathematical approach for solving problems having uncertainties. Many researchers worked on the findings of structures of soft set theory and applied to many problems having uncertainties.…
We present the first general formulas for the central and non-central moments of the multinomial distribution, using a combinatorial argument and the factorial moments previously obtained in Mosimann (1962). We use the formulas to give…
The hypergraph container lemma is a powerful tool in probabilistic combinatorics that has found many applications since it was first proved a decade ago. Roughly speaking, it asserts that the family of independent sets of every uniform…
In this paper, a decomposition theorem for (covariant) unitary group representations on Kaplansky-Hilbert modules over Stone algebras is established, which generalizes the well-known Hilbert space case (where it coincides with the…
We introduce a class of permutation centralizer algebras which underly the combinatorics of multi-matrix gauge invariant observables. One family of such non-commutative algebras is parametrised by two integers. Its Wedderburn-Artin…
We introduce new notions of weighted centrality and weighted commutators corresponding to each other in the same way as centrality of congruences and commutators do in the Smith commutator theory. Both the Huq commutator of subobjects and…
Sets satisfying Central sets theorem and other Ramsey theoretic large sets were studied extensively in literature. Hindman and Strauss proved that product of some of these large sets is again large. In this paper we show that if we take two…
Zeckendorf proved that every positive integer has a unique representation as a sum of non-consecutive Fibonacci numbers. A natural generalization of this theorem is to look at the sequence defined as follows: for $n\ge 2$, let $F_{n,1} =…
There are several notions of largeness in a semigroup. N. Hindman and D. Strauss established that if $u,v \in \mathbb{N}$, $A$ is a $u \times v$ matrix with entries from $\mathbb{Q}$ and $\psi$ is a notion of a large set in $\mathbb{N}$,…
In recent years, centrally essential rings have been intensively studied in ring theory. In particular, they find applications in homological algebra, group rings, and the structural theory of rings. The class of essentially central rings…
We prove Bergman's theorem on centralizers by using generic matrices and Kontsevich's quantization method. For any field $\textbf{k} $ of positive characteristics, set $A=\textbf{k} \langle x_1,\dots,x_s\rangle$ be a free associative…
A semidomain is a subsemiring of an integral domain. We call a semidomain $S$ additively reduced if $0$ is the only invertible element of the monoid $(S, +)$, while we say that $S$ is additively Furstenberg if every non-invertible element…
Compact sets in constructive mathematics capture our intuition of what computable subsets of the plane (or any other complete metric space) ought to be. A good representation of compact sets provides an efficient means of creating and…
The $p$-set, which is in a simple analytic form, is well distributed in unit cubes. The well-known Weil's exponential sum theorem presents an upper bound of the exponential sum over the $p$-set. Based on the result, one shows that the…
The aim of this paper is to introduce the notion of cornets, which form a particular subclass of ordered semigroups also equipped with a multiplication by natural numbers. The most important standard examples for cornets are the families of…
Most of the assertions in the theory of well ordered sets are quite simple. However, one of its central statements, Zermelo's theorem, stands out of this rule, for its well-known proofs are rather complicated. The aim of the current paper…
We present the basic theory of central subsets of semigroups from the nonstandard perspective. A key feature of this perspective is the replacement of the algebra of ultrafilters with the algebra of elements of iterated hyperextensions, a…
The theory of optimal choice sets offers a well-established solution framework in social choice and game theory. In social choice theory, decision-making is typically modeled as a maximization problem. However, when preferences are cyclic…
A beautiful theorem of Zeckendorf states that every integer can be written uniquely as the sum of non-consecutive Fibonacci numbers $\{ F_i \}_{i = 1}^{\infty}$. A set $S \subset \mathbb{Z}$ is said to satisfy Benford's law if the density…
Jacobson's commutativity theorem says that a ring is commutative if, for each $x$, $x^n = x$ for some $n > 1$. Herstein's generalization says that the condition can be weakened to $x^n-x$ being central. In both theorems, $n$ may depend on…