280 research outputs found
Some binomial sums involving absolute values
We consider several families of binomial sum identities whose definition
involves the absolute value function. In particular, we consider centered
double sums of the form obtaining new results in the cases . We show that there is a close connection between these double sums in the
case and the single centered binomial sums considered by Tuenter.Comment: 15 pages, 19 reference
A precise description of the p-adic valuation of the number of alternating sign matrices
Following Sun and Moll, we study v_p(T(N)), the p-adic valuation of the
counting function of the alternating sign matrices. We find an exact analytic
expression for it that exhibits the fluctuating behaviour, by means of Fourier
coefficients. The method is the Mellin-Perron technique, which is familiar in
the analysis of the sum-of-digits function and related quantities
On Ramanujan's Q-function
This study provides a detailed analysis of a function which Knuth discovered to play a central role in the analysis of hashing with linear probing. The function, named after Knuth Q(n), is related to several of Ramanujan's investigations. It surfaces in the analysis of a variety of algorithms ans discrete probability problems including hashing, the birthday paradox, random mapping statistics, the "rho" method for integer factorization, union-find algorithms, optimum caching, and the study of memory conflicts. A process related to the complex asymptotic methods of singularity analysis and saddle point integrals permits to precisely quantify the behaviour of the Q(n) function. in this way, tight bounds are derived. They answer a question of Knuth (the art of Computer Programming, vol. 1, 1968), itself a rephrasing of earlier questions of Ramanujan in 1911-1913
Forcing Adsorption of a Tethered Polymer by Pulling
We present an analysis of a partially directed walk model of a polymer which
at one end is tethered to a sticky surface and at the other end is subjected to
a pulling force at fixed angle away from the point of tethering. Using the
kernel method, we derive the full generating function for this model in two and
three dimensions and obtain the respective phase diagrams.
We observe adsorbed and desorbed phases with a thermodynamic phase transition
in between. In the absence of a pulling force this model has a second-order
thermal desorption transition which merely gets shifted by the presence of a
lateral pulling force. On the other hand, if the pulling force contains a
non-zero vertical component this transition becomes first-order.
Strikingly, we find that if the angle between the pulling force and the
surface is beneath a critical value, a sufficiently strong force will induce
polymer adsorption, no matter how large the temperature of the system.
Our findings are similar in two and three dimensions, an additional feature
in three dimensions being the occurrence of a reentrance transition at constant
pulling force for small temperature, which has been observed previously for
this model in the presence of pure vertical pulling. Interestingly, the
reentrance phenomenon vanishes under certain pulling angles, with details
depending on how the three-dimensional polymer is modeled
Trees with Given Stability Number and Minimum Number of Stable Sets
We study the structure of trees minimizing their number of stable sets for
given order and stability number . Our main result is that the
edges of a non-trivial extremal tree can be partitioned into stars,
each of size or , so that every vertex is included in at most two
distinct stars, and the centers of these stars form a stable set of the tree.Comment: v2: Referees' comments incorporate
Tur\'an Graphs, Stability Number, and Fibonacci Index
The Fibonacci index of a graph is the number of its stable sets. This
parameter is widely studied and has applications in chemical graph theory. In
this paper, we establish tight upper bounds for the Fibonacci index in terms of
the stability number and the order of general graphs and connected graphs.
Tur\'an graphs frequently appear in extremal graph theory. We show that Tur\'an
graphs and a connected variant of them are also extremal for these particular
problems.Comment: 11 pages, 3 figure
Super congruences and Euler numbers
Let be a prime. We prove that
, where E_0,E_1,E_2,... are Euler numbers. Our new approach is of
combinatorial nature. We also formulate many conjectures concerning super
congruences and relate most of them to Euler numbers or Bernoulli numbers.
Motivated by our investigation of super congruences, we also raise a conjecture
on 7 new series for , and the constant
(with (-) the Jacobi symbol), two of which are
and
\sum_{k>0}(15k-4)(-27)^{k-1}/(k^3\binom{2k}{k}^2\binom{3k}k)=K.$
- …