• Corpus ID: 42170397

A brief note on estimates of binomial coefficients

  title={A brief note on estimates of binomial coefficients},
  author={Shagnik Das},
Through the ages, humankind has struggled to come to terms with its own existence, a thorny issue that will no doubt keep philosophers tossing and turning in their beds for aeons to come. The ‘how’ of our existence, though still fiercely debated in some corners, is now reasonably well-understood, but it is the ‘why’ that continues to plague us. Why are we here? What purpose are we meant to serve? Thus we continue to live our lives, with no end in sight on our quest of self-discovery. However… 
Explicit results in theory of zeros and prime numbers
This thesis is comprised of three articles in which we prove explicit estimates for different number theoretical problems. In the first article we derive an explicit Riemann-von Mangoldt formula for
Polynomial Identity Testing for Low Degree Polynomials with Optimal Randomness
We give a randomized polynomial time algorithm for polynomial identity testing for the class of n-variate poynomials of degree bounded by d over a field F, in the blackbox setting. Our algorithm
Understanding the hardness of approximate query processing with joins
The results show that for various database queries with joins, unless restricted to the set of queries whose results are always guaranteed to be above a very large threshold, the amount of information an AQP algorithm needs for returning an accurate approximation is at least linear in the number of rows in the largest table.
τ -Li coefficients describe if a function satisfies the Generalized Riemann Hypothesis or not. In this paper we prove that certain values of the τ -Li coefficients lead to existence or non-existence
Rank-Optimal Assignments in Uniform Markets
We prove that in a market where agents rank objects independently and uniformly at random, there exists an assignment of objects to agents with a constant average rank (i.e., an average rank
Approximate Random Allocation Mechanisms
We generalize the scope of random allocation mechanisms, in which the mechanism first identifies a feasible “expected allocation” and then implements it by randomizing over nearby feasible integer
On the Automation of the Token Graphs
This software was developed in the high-level programming languages C++ and Wolfram Mathematica and it is able to automatically generate token graphs of a given graph so that the study and the teaching of that family of graphs become easier.
Causal Inference under Network Interference with Noise
Increasingly, there is a marked interest in estimating causal effects under network interference due to the fact that interference manifests naturally in networked experiments. However, network
Performance bounds for QC-MDPC codes decoders
This work provides lower and upper bounds on the performance of ML decoding of QC-MDPC codes and shows that the DFR of the ML decoder decays polynomially in the QC- MDPC code length when all other parameters are fixed.
Multi-Agent Path Finding in Configurable Environments
C-MAPF is introduced, i.e., MAPF in Configurable environments, a novel variant of the MAPF problem in which the environment is configurable, namely its structure and topology can be controlled within some given constraints.