Related papers: A combinatorial approach to the stronger Central S…
In 1978 Kostant suggested the Whittaker model of the center of the universal enveloping algebra U(g) of a complex simple Lie algebra g. The main result is that the center of U(g) is isomorphic to a commutative subalgebra in U(b), where b is…
A theorem of Wiener on the circle group was strengthened and extended by Fournier in [2] to locally compact abelian groups and extended further to the Bessel-Kingman hypergroup with parameter {\alpha} = 1 / 2 by Bloom/Fournier/Leinert in…
The concept of a $\Gamma$-semigroup has been introduced by Mridul Kanti Sen in the Int. Symp., New Delhi, 1981. It is well known that the Green's relations play an essential role in studying the structure of semigroups. In the present paper…
We use the recently developed method of weighted dependency graphs to prove central limit theorems for the number of occurrences of any fixed pattern in multiset permutations and in set partitions. This generalizes results for patterns of…
The Union Closed Sets Conjecture is one of the most renowned problems in combinatorics. Its appeal lies in the simplicity of its statement contrasted with the potential complexity of its resolution. The conjecture posits that, in any union…
The first author and Oguni introduced a class of groups of non-positive curvature, called coarsely convex group. The recent success of the theory of groups which are hyperbolic relative to a collection of subgroups has motivated the study…
We extend the notion of mex, which is central in combinatorial number theory, to an arbitrary combinatorial structure, and we prove a general theorem to determine the generating function of the objects having fixed mex. We then study this…
The Central Limit Theorem (CLT) establishes that sufficiently large sequences of independent and identically distributed random variables converge in probability to a normal distribution. This makes the CLT a fundamental building block of…
Combinatorial methods (or methods of elementary transformations) came to group theory from low-dimensional topology in the beginning of the century. Soon after that, combinatorial group theory became an independent area with its own…
Classical mathematics are founded within set theory, but sets don't have \emph{symmetries}. We conjecture that if we allow sets with symmetries, then many problems such as \emph{Mirror symmetry} or \emph{Homological mirror symmetry} can be…
Recently a new type of central limit theorem for belief functions was given in Epstein et al. [9]. In this paper, we generalize the central limit theorem in Epstein et al. [9] to accommodate general bounded random variables. These results…
This paper establishes a combinatorial central limit theorem for stratified randomization, which holds under a Lindeberg-type condition. The theorem allows for an arbitrary number or sizes of strata, with the sole requirement being that…
Given a group $G$, we say that a set $A \subseteq G$ has more sums than differences (MSTD) if $|A+A| > |A-A|$, has more differences than sums (MDTS) if $|A+A| < |A-A|$, or is sum-difference balanced if $|A+A| = |A-A|$. A problem of recent…
We introduce a new combinatorial structure: the superselector. We show that superselectors subsume several important combinatorial structures used in the past few years to solve problems in group testing, compressed sensing, multi-channel…
In this paper, we show that if the reduced Fourier-Stieltjes algebra $B_{\rho}(G)$ of a second countable locally compact group $G$ has either weak* fixed point property or asymptotic center property, then $G$ is compact. As a result, we…
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…
We construct a functor associating a cubical set to a (simple) graph. We show that cubical sets arising in this way are Kan complexes, and that the A-groups of a graph coincide with the homotopy groups of the associated Kan complex. We use…
In this paper, we give a new completion for quasi-uniform spaces which generalizes the completion theories of Doitchinov [8] and Stoltenberg [20]. The presented completion theory is very well-behaved and extends the completion theory of…
New sets (typically found by computer search) with Sidon constant equal to the square root of their cardinalities are given. For each integer $N$ there are only a finite number of groups of prime order containing $N$-element extreme sets.…
ZFC has sentences that quantify over all sets or all ordinals, without restriction. Some have argued that sentences of this kind lack a determinate meaning. We propose a set theory called TOPS, using Natural Deduction, that avoids this…