Related papers: Combinatorial Aspects of the Splitting Number

Let $k$ be a natural number and let $c=2.134693\ldots$ be the unique real solution of the equation $2c=2+\log (5c-1)$ in $[1,\infty)$. Then, when $s\ge ck+4$, we establish an asymptotic lower bound of the expected order of magnitude for the…

Counting integral binary quadratic forms with certain restrictions is a classical problem. In this paper, we count binary quadratic forms of fixed discriminant given restrictions on the size of their coefficients. We accomplish this by…

When k > 1 and s is sufficiently large in terms of k, we derive an explicit multi-term asymptotic expansion for the number of representations of a large natural number as the sum of s positive integral k-th powers.

The Stirling number of the second kind $n\brace k$ counts the number of ways to partition a set of $n$ labeled balls into $k$ non-empty unlabeled cells. As an extension of this, we consider $b_1+b_2+\ldots+b_n$ balls with $b_1$ balls…

In 1882 J.J. Sylvester already proved, that the number of different ways to partition a positive integer into consecutive positive integers exactly equals the number of odd divisors of that integer (see [1]). We will now develop an…

Let $\overline{\mathrm{spt}}k(n)$ denote the number of overpartitions of $n$ where the smallest non-overlined part, say $s(\pi)$, appears $k$ times and every overlined part is bigger than $s(\pi)$. Let $\overline{\mathrm{spt}}k_o(n)$ denote…

We define a Carmichael number of order m to be a composite integer n such that nth-power raising defines an endomorphism of every Z/nZ-algebra that can be generated as a Z/nZ-module by m elements. We give a simple criterion to determine…

Let $G$ be a finite abelian group. We say that $M$ and $S$ form a \textsl{splitting} of $G$ if every nonzero element $g$ of $G$ has a unique representation of the form $g=ms$ with $m\in M$ and $s\in S$, while $0$ has no such representation.…

A congruence of the weak order is simple if its quotientope is a simple polytope. We provide an alternative elementary proof of the characterization of the simple congruences in terms of forbidden up and down arcs. For this, we provide a…

A singularity is said to be exceptional (in the sense of V. Shokurov), if for any log canonical boundary, there is at most one exceptional divisor of discrepancy -1. In our previous paper (math.AG/9805004) we found two examples of…

Even with the introduction of supercharacter theories, the representation theory of many unipotent groups remains mysterious. This paper constructs a family of supercharacter theories for normal pattern groups in a way that exhibit many of…

The concept of graph compositions is related to several number theoretic concepts, including partitions of positive integers and the cardinality of the power set of finite sets. This paper examines graph compositions where the total number…

Let A be a nonempty finite set of relatively prime positive integers, and let p_A(n) denote the number of partitions of n with parts in A. An elementary arithmetic argument is used to obtain an asymptotic formula for p_A(n).

A propositional proof system $P$ has the strong feasible disjunction property iff there is a constant $c \geq 1$ such that whenever $P$ admits a size $s$ proof of $\bigvee_i \alpha_i$ with no two $\alpha_i$ sharing an atom then one of…

Let $S$ be the numerical semigroup generated by three consecutive numbers $a,a+1,a+2$, where $a\in\mathbb{N}$, $a\geq 3$. We describe the elements of $S$ whose factorizations have all the same length, as well as the set of factorizations of…

From the symmetry between definitions of left and right divisors in associative $D$-algebra $A$, the possibility to define quotient as $A\otimes A$-number follows. In the paper, I considered division and division with remainder. I…

We give explicit positive combinatorial interpretations for the plethysm coefficients $\langle s_\mu[s_\nu], s_\lambda\rangle$, when $\lambda$ has at most two rows, as counting certain marked trees. In the special case $\mu=(n)$, this also…

Let $S$ be a multiplicatively idempotent congruence-simple semiring. We show that $|S|=2$ if $S$ has a multiplicatively absorbing element. We also prove that if $S$ is finite then either $|S|=2$ or $S\cong End(L)$ or $S^{op}\cong End(L)$…

Continued fractions whose elements are polynomial sequences have been carefully studied mostly in the cases where the degree of the numerator polynomial is less than or equal to two and the degree of the denominator polynomial is less than…

In this paper, we exploit the r-Stirling numbers of both kinds in order to give explicit formulae for the values of the high order Bernoulli numbers and polynomials of both kinds at integers. We give also some identities linked the…