Related papers: A family of formulas with reversal of arbitrarily …
As a consequence of the Integral Test we find a triple inequality which bounds up and down both a series with respect to its corresponding improper integral, and reciprocally an improper integral with respect to its corresponding series.
We give an explicit upper bound for the number of equivalence classes of binary forms with rational integral coefficients of given degree and given discriminant, and with given splitting field. Further, we give an explicit upper bound for…
In this study, we introduce a new class of quaternions associated with the well-known modified third-order Jacobsthal numbers. There are many studies about the quaternions with special integer sequences and their generalizations. All of…
We give an explicit formula for the number of permutations avoiding cyclically a consecutive pattern in terms of the spectrum of the associated operator of the consecutive pattern. As an example, the number of cyclically consecutive…
In combinatorics on words, a word $w$ over an alphabet $\Sigma$ is said to avoid a pattern $p$ over an alphabet $\Delta$ if there is no factor $f$ of $w$ such that $f=h(p)$ where $h:\Delta^*\to\Sigma^*$ is a non-erasing morphism. A pattern…
Triangular decomposition is a classic, widely used and well-developed way to represent algebraic varieties with many applications. In particular, there exist sharp degree bounds for a single triangular set in terms of intrinsic data of the…
A recursion formula is derived which allows to evaluate invariant integrals over the orthogonal group O(N), where the integrand is an arbitrary finite monomial in the matrix elements of the group. The value of such an integral is…
A priori bound for the parameter to be estimated is incorporated into confidence intervals within frequentistic approach in a straightforward and optimal fashion, ensuring the best resolution of non-boundary values as well as robustness for…
We prove a generalization of a conjecture of Dokos, Dwyer, Johnson, Sagan, and Selsor giving a recursion for the inversion polynomial of 321-avoiding permutations. We also answer a question they posed about finding a recursive formulas for…
We present a new approach to the problem of enumerating permutations of length n that avoid a fixed consecutive pattern of length m. We use this idea to give explicit upper and lower bounds on the number of permutations avoiding a pattern…
We consider a family of integer sequences generated by nonlinear recurrences of the second order, which have the curious property that the terms of the sequence, and integer multiples of the ratios of successive terms (which are also…
We have derived a family of equations related to the untwisted affine Lie algebras $A^{(1)}_{r}$ using a Coxeter $\mathbb{Z}_{r+1}$ reduction. They represent the third member of the hierarchy of soliton equations related to the algebra. We…
We enumerate and characterize some classes of alternating and reverse alternating involutions avoiding a single pattern of length three or four. If on one hand the case of patterns of length three is trivial, on the other hand, the length…
An adjustable algorithm of exclusion of conditional equations with excessive residuals is proposed. The criteria applied in the algorithm use variable exclusion limits which decrease as the number of equations goes down. The algorithm is…
We show that the points that converge to infinity under iteration of the exponential map form a connected subset of the complex plane.
We prove an infinite family of lacunary recurrences for the Lucas numbers using combinatorial means.
The least upper bound on degrees of elements of a minimal system of generators of the algebra of invariants of 3x3 matrices is found, and the nilpotency degree of a relatively free finitely generated algebra with the identity x^3=0 is…
An irreducible canonical approach to second-class constraints reducible of an arbitrary order is given. This method generalizes our previous results from [Europhys. Lett. 50 (2000) 169, J. Phys. A: Math. Theor. 40 (2007) 14537] for first-…
An infinte word w avoids a pattern p with the involution t if there is no substitution for the variables in p and no involution t such that the resulting word is a factor of w. We investigate the avoidance of patterns with respect to the…
Let $R(x)=g(x)/h(x)$ be a rational expression of degree three over the finite field $\mathbb{F}_q$. We count the irreducible polynomials in $\mathbb{F}_q[x]$, of a given degree, which have the form $h(x)^{\mathrm{deg}\, f}\cdot…