Related papers: Cardinality of a floor function set
In this article, we give a proof for that the cardinality of a function basis of the invariants for a finite dimensional real vector space by a compact group is lower bounded by the intuitive difference of the dimensions of the vector space…
We investigate compositions of a positive integer with a fixed number of parts, when there are several types of each natural number. These compositions produce new relationships among binomial coefficients, Catalan numbers, and numbers of…
We provide upper bounds for the cardinality of the value set of a polynomial map in several variables over a finite field. These bounds generalize earlier bounds for univariate polynomials.
We identify pairs of positive integers $(t, d)$ with the property that the integer sequence with general term $\lfloor{n^t/d\rfloor}$ contains at most finitely many primes.
B. D. Acharya has conjectured that if $\bigl(A_i: i=1, 2, ..., 2^{|X|}-1\bigr)$ is a permutation of all nonempty subsets of a set $X$ with at least two elements such that for each even positive integer $j<2^{|X|}-1$, $A_{j-1}\triangle…
Let $\mathbb{F}_{q}$ be a finite field of characteristic $p$, and let $f \in \mathbb{F}_{q}[x]$ be a polynomial of degree $d > 0$. Denote the image set of this polynomial as $V_{f}=\{f(\alpha)\mid\alpha\in\mathbb{F}_{q}\}$ and denote the…
Continuing our work on group-theoretic generalizations of the prime Ax-Katz Theorem, we give a lower bound on the $p$-adic divisibility of the cardinality of the set of simultaneous zeros $Z(f_1,f_2,\ldots,f_r)$ of $r$ maps…
For any finite field $\mathbb{F}$ and any positive integer $n$ we count the number of monic polynomials of degree $n$ over $\mathbb{F}$ with nonzero constant coefficient and a self-reciprocal factor of any specified degree. An application…
Let $a=(a_1,\ldots,a_n)$ and $b=(b_1,\ldots,b_n)$ be two $n$-tuples of positive integers, let $X$ be a set of positive integers, and let $g$ be a positive integer. In this work we show an algorithmic process in order to compute all the sets…
Some identities are presented that generalize the formula x^3 = 3x floor(x floor(x)) - 3 floor(x) floor(x floor(x)) + floor(x)^3 + 3 frac(x) frac(x floor(x)) + frac(x)^3 to a representation of the product x_0x_1 ... x_{n-1}.
The investigation of primes in certain arithmetic sequences is one of the fundamental problems in number theory and especially, finding blocks of distinct primes has gained a lot of attention in recent years. In this context, we prove the…
We classify the possible ramification data and etale local structure of orders over surfaces with canonical singularities.
Previous work has axiomatised the cardinality operation in relation algebras, which counts the number of edges of an unweighted graph. We generalise the cardinality axioms to Stone relation algebras, which model weighted graphs, and study…
Over finite fields, if the image of a polynomial map is not the entire field, then its cardinality can be bounded above by a significantly smaller value. Earlier results bound the cardinality of the value set using the degree of the…
We prove that the strong polarized relation of $\theta$ above $\omega$ applied simultaneously for every cardinal in the interval $[\aleph_1,\aleph]$ is consistent. We conclude that this positive relation is consistent for every cardinal…
We determine the finite groups $G$ in which every subset $A \subseteq G$ of cardinality dividing the order of $G$ is a \emph{factor}, i.e. has a complement $B \subseteq G$ of cardinality $|G|/|A|$ such that $G = A \cdot B$ or $G = B \cdot…
We study a generalization of the classical stable matching problem that allows for cardinal preferences (as opposed to ordinal) and fractional matchings (as opposed to integral). After observing that, in this cardinal setting, stable…
It is shown that any denumerable list L to which Cantor's diagonal method was applied is incomplete. However, this doesn't allow us to affirm that the cardinality of the real numbers of the interval [0, 1] is greater than the cardinality of…
In this paper, we define an ordering relation for a set of complex numbers, and research the properties and theorems of the ordering, solve some simple complex inequalities with the ordering.
Fix $A$, a family of subsets of natural numbers, and let $G_A(n)$ be the maximum cardinality of a subset of $\{1,2,..., n\}$ that does not have any subset in $A$. We consider the general problem of giving upper bounds on $G_A(n)$ and give…