Related papers: Generators of aggregation functions and fuzzy conn…
The powers of generating functions and its properties are analyzed. A new class of functions is introduced, based on the application of compositions of an integer $n$, called composita. The methods for obtaining reciprocal and reverse…
Let $c_n$ denote the number of nodes at a distance $n$ from the root of a rooted tree. A criterion for proving the rationality and computing the rational generating function of the sequence $\{c_n\}$ is described. This criterion is applied…
We derive an explicit expression for an associative *-product on fuzzy complex projective spaces. This generalises previous results for the fuzzy 2-sphere and gives a discrete non-commutative algebra of functions on fuzzy complex projective…
We compute generating functions for the sum of the real-valued character degrees of the finite general linear and unitary groups, through symmetric function computations. For the finite general linear group, we get a new combinatorial proof…
We continue to consider the ordered lexicographic sequence, which is constructed according to the formal characteristics of a series of natural numbers. For analysis, we selected balanced parentheses with zeros, Motzkin words. As you know,…
A compactly generated group is noncompact if and only if it admits a nonconstant harmonic function (for some, equivalently for every, reasonable measure). This generalizes the known fact that a finitely generated group is infinite if and…
Graduated locally finitely presentable categories are introduced, examples include categories of sets, vector spaces, posets, presheaves and Boolean algebras. A finitary functor between graduated locally finitely presentable categories is…
In this paper the concept of $\mathbb{F}$-functorial of a finite group was introduced. These functorials have many properties of the Fitting subgroup of a soluble group and the generalized Fitting subgroup of a finite group. It was shown…
We introduce a generating function associated to the homogeneous generators of a graded algebra that measures how far is this algebra from being finitely generated. For the case of some algebras of Frobenius endomorphisms we describe this…
In this article we aim to develop from first principles a theory of sum sets and partial sum sets, which are defined analogously to difference sets and partial difference sets. We obtain non-existence results and characterisations. In…
Let $<\P > \subset \N$ be a multiplicative subsemigroup of the natural numbers $\N = \{1,2,3,...\}$ generated by an arbitrary set $\P$ of primes (finite or infinite). We given an elementary proof that the partial sums $\sum_{n \in < \P >: n…
The unique prime factorization theorem is used to show the existence of a function on a countable set $\mathcal{X}$ so that the sum aggregator function is injective on all multisets of $\mathcal{X}$ of finite size.
Erickson defined the fusible numbers as a set $\mathcal F$ of reals generated by repeated application of the function $\frac{x+y+1}{2}$. Erickson, Nivasch, and Xu showed that $\mathcal F$ is well ordered, with order type $\varepsilon_0$.…
This paper introduces the concept of kernels on fuzzy sets as a similarity measure for $[0,1]$-valued functions, a.k.a. \emph{membership functions of fuzzy sets}. We defined the following classes of kernels: the cross product, the…
We enumerate the independent sets of several classes of regular and almost regular graphs and compute the corresponding generating functions. We also note the relations between these graphs and other combinatorial objects and, in some…
Gaussian elimination answers any question about a finitely presented vector space. However, a "uniform family" of such presentations--given as generic relations among an unspecified number of generators--is susceptible to elimination only…
In this work we define a unified generating functions for 9 different kinds of set partitions including cyclically ordered set partitions. Such generating function depends on 4 parameters. We consider property of this function and provide…
Using countable support iteration of $S$-proper posets, for some appropriate stationary set $S$, we obtain a generic extension of the constructible universe, in which $\mathfrak{b}=\mathfrak{c}=\aleph_2$ and there is a maximal cofinitary…
For any order of growth $f(n)=o(\log n)$ we construct a finitely-generated group $G$ and a set of generators $S$ such that the Cayley graph of $G$ with respect to $S$ supports a harmonic function with growth $f$ but does not support any…
Although degree bounds and algorithms for the generators of various invariant rings have been known for decades, little is known about the cardinality of minimal generating sets. Estimates of such would provide lower bounds for the runtime…