相关论文: Cardinality of Rauzy classes

The concept of a fuzzy number is generalized to the case of a finite carrier set of partially ordered elements, more precisely, a lattice, when a membership function also takes values in a partially ordered set (a lattice). Zadeh's…

For a commutative ring $R$, a polynomial $f\in R[x]$ is called separable if $R[x]/f$ is a separable $R$-algebra. We derive formulae for the number of separable polynomials when $R = \mathbb{Z}/n$, extending a result of L. Carlitz. For…

C. F. Gauss discovered a beautiful formula for the number of irreducible polynomials of a given degree over a finite field. Assuming just a few elementary facts in field theory and the exclusion-inclusion formula, we show how one see the…

Cumulants linearize convolution of measures. We use a formula of Good to define noncommutative cumulants in a very general setting.It turns out that the essential property needed is exchangeability of random variables. Roughly speaking the…

We obtain explicit upper bounds for the number of irreducible factors for a class of compositions of polynomials in several variables over a given field. In particular, some irreducibility criteria are given for this class of compositions…

This article is meant to give a lucid and widely accessible, self-contained account of a novel way of performing arithmetic operations on fuzzy intervals. Based on two formulae of generalized inversion (the first in close analogy to the…

Let $\mathbb{N}$ be a set of the natural numbers. Symmetric inverse semigroup $R_\infty$ is the semigroup of all infinite 0-1 matrices $[g_{ij}]$ with at most one 1 in each row and each column such that $g_{ii}=1$ on the complement of a…

Classification is an important goal in many branches of mathematics. The idea is to describe the members of some class of mathematical objects, up to isomorphism or other important equivalence in terms of relatively simple invariants. Where…

We determine all composition-closed equational classes of Boolean functions. These classes provide a natural generalization of clones and iterative algebras: they are closed under composition, permutation and identification…

Let $R$ be an associative ring with identity and let $N$ be a nil ideal of $R$. It is shown that units of $R/N$ can be lifted to units in $R$. Under some mild conditions on the ring, a procedure is given to determine those lifted units in a…

In this paper, we study the unimodular equivalence of sublattices in an $n$-dimensional lattice. A recursive procedure is given to compute the cardinalities of the unimodular equivalent classes with the indices which are powers of a prime…

Let $\mathcal{A}$ be the family of functions $f(z)=z+a_2z^2+...$ which are analytic in the open unit disc $\mathbb{D}=\{z: |z|<1 \}$, and denote by $\pe$ of functions $p(z)=z+p_1z+p_2z^2+...$ analytic in $\de$ such that $p(z)$ is in $\pe$…

Let c be the cardinality of the continuum. We give a family of pairwise incomparable clones (on a countable base set) 2^c members, all with the same unary fragment, namely the set of all unary operations. We also give, for each n, a family…

In this article algebraic constructions are introduced in order to study the variety defined by a radical parametrization (a tuple of functions involving complex numbers, $n$ variables, the four field operations and radical extractions). We…

We prove some consistency results about b(lambda) and d(lambda), which are natural generalisations of the cardinal invariants of the continuum b and d. We also define invariants b_cl(lambda) and d_cl(lambda), and prove that almost always…

We introduce ballot matrices, a signed combinatorial structure whose definition naturally follows from the generating function for labeled interval orders. A sign reversing involution on ballot matrices is defined. We show that matrices…

For any class of operators which transform unary total functions in the set of natural numbers into functions of the same kind, we define what it means for a real function to be uniformly computable or conditionally computable with respect…

Constant dimension codes are subsets of the finite Grassmann variety. The study of these codes is a central topic in random linear network coding theory. Orbit codes represent a subclass of constant dimension codes. They are defined as…

There are well known algorithms to compute the class group of the maximal order $\mathcal{O}_K$ of a number field $K$ and the group of invertible ideal classes of a non-maximal order $R$. In this paper we explain how to compute also the…

We prove that if there is an elementary embedding from the universe to itself, then there is a proper class of measurable successor cardinals.