Related papers: Binomial posets with non-isomorphic intervals
We classify all unmixed monomial ideals I of codimension 2 which are generically a complete intersection and which have the property that the symbolic power algebra A(I) is standard graded. We give a lower bound for the highest degree of a…
In this short note we prove that the finite non-abelian simple groups PSL(2,q), where q = 5,7, are determined by their posets of classes of isomorphic subgroups. In particular, this disproves the conjecture in the end of [5].
Given any two sequences of complex numbers, we establish simple relations between their binomial convolution and the binomial convolution of their individual binomial transforms. We employ these relations to derive new identities involving…
Let A be a set of integers dense in a finite interval. We establish upper and lower bounds for the longest regularly-spaced and convex subsets of A and of A-A.
We introduce a new type of partitions that consists of partitions whose different parts alternate in parity (e.g., $3+2+2+1+1$). Various properties of this partition function are studied. In particular, we obtain its asymptotic behavior by…
The invariants of finite-dimensional representations of simple Lie algebras, such as even-degree indices and anomaly numbers, are considered in the context of the non-crystallographic finite reflection groups $H_2$, $H_3$ and $H_4$. Using a…
The polynomial coefficient $\binom {n,q}{k}$ is defined to be the coefficient of $x^{k}$ in the expansion of $(1+x+x^2+... +x^{q-1})^n$. In this note we give an asymptotic estimate for $\binom {n,q}{cn}$ as $n$ tends to infinity, where $c$…
A Parity Alternating Permutation of the set $[n] = \{1, 2,\ldots, n\}$ is a permutation with even and odd entries alternatively. We deal with parity alternating permutations having an odd entry in the first position, PAPs. We study the…
In this short note, we relate the boxicity of graphs (and the dimension of posets) with their generalized coloring parameters. In particular, together with known estimates, our results imply that any graph with no $K_t$-minor can be…
We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to…
In this paper, we give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for…
A chain poset, by definition, consists of chains of ordered elements in a poset. We study the chain posets associated to two posets: the Boolean algebra and the poset of isotropic flags. We prove that, in both cases, the chain posets…
It is shown that some topological equivalency classes of S-unimodal maps are equal to quasisymmetric conjugacy classes. This includes some infinitely renormalizable polynomials of unbounded type.
We say a natural number $n$ is matchable if there is a bijection from the set of $\tau(n)$ divisors of $n$ to the set $\{1,2,\dots,\tau(n)\}$, where corresponding numbers are relatively prime. We show that the set of matchable numbers has…
In this paper we obtain the non-asymptotic norm estimations of Besov's type between the norms of a functions in different Bilateral Grand Lebesgue spaces (BGLS). We also give some examples to show the sharpness of these inequalities.
Two approximations of the integral of a class of sinusoidal composite functions, for which an explicit form does not exist, are derived. Numerical experiments show that the proposed approximations yield an error that does not depend on the…
The summatory function of the number of binomial coefficients not divisible by a prime is known to exhibit regular periodic oscillations, yet identifying the less regularly behaved minimum of the underlying periodic functions has been open…
We prove that there is a monadic adjunction between the category of bounded posets with involution and the category of orthomodular posets.
We present a bijection between non-crossing partitions of the set $[2n+1]$ into $n+1$ blocks such that no block contains two consecutive integers, and the set of sequences $\{s_{i}\}_{1}^{n}$ such that $1 \leq s_{i} \leq i$, and if…
Sidon sets are those sets such that the sums of two of its elements never coincide. They go back to the 30s when Sidon asked for the maximal size of a subset of consecutive integers with that property. This question is now answered in a…