Related papers: Warning's Second Theorem with Resricted Variables

Nowadays there are several classes of constrained codes intended for different applications. The following two large classes can be distinguished. The first class contains codes with local constraints; for example, the source data must be…

In many data analyses, each measurement may come with a simple yes/no correction; for example, belonging to one of two populations or being contaminated or not. Ignoring such binary effects may bias the results, while accounting for them…

We extend the Ax-Katz theorem for a single polynomial from finite fields to the rings Z_m with m composite. This extension not only yields the analogous result, but gives significantly higher divisibility bounds. We conjecture what computer…

A recent article on generalised linear mixed model asymptotics, Jiang et al. (2022), derived the rates of convergence for the asymptotic variances of maximum likelihood estimators. If $m$ denotes the number of groups and $n$ is the average…

There are many ways of establishing upper bounds on fluctuations of random variables, but there is no systematic approach for lower bounds. As a result, lower bounds are unknown in many important problems. This paper introduces a general…

An old conjecture of Erd\H{o}s and R\'enyi, proved by Schinzel, predicted a bound for the number of terms of a polynomial $g(x) \in \mathbb{C}[x]$ when its square $g(x)^2$ has a given number of terms. Further conjectures and results arose,…

In this work, the combine the theory of generalized critical values with the theory of iterated rings of bounded elements (real holomorphy rings). We consider the problem of computing the global infimum of a real polynomial in several…

In this short paper, we give an upper bound for the number of different basic feasible solutions generated by the simplex method for linear programming problems having optimal solutions. The bound is polynomial of the number of constraints,…

We show that a lower bound for covariance of $\min(X_1,X_2)$ and $\max(X_1,X_2)$ is $\cov{X_1}{X_2}$ and an upper bound for variance of \\ $\min(X_2,\max(X,X_1))$ is $\var{X} + \var{X_1} +\var{X_2}$ generalizing previous results. We also…

The Barankin bound is generalized to the vector case in the mean square error sense. Necessary and sufficient conditions are obtained to achieve the lower bound. To obtain the result, a simple finite dimensional real vector valued…

Given an integer base $b\geq 2$, a number $\rho\geq 1$ of colors, and a finite sequence $\Lambda=(\lambda_1,\ldots,\lambda_\rho)$ of positive integers, we introduce the concept of a $\Lambda$-restricted $\rho$-colored $b$-ary partition of…

A finite form of de Finetti's representation theorem is established using elementary information-theoretic tools: The distribution of the first $k$ random variables in an exchangeable binary vector of length $n\geq k$ is close to a mixture…

The multinomial model is one of the simplest statistical models. When constraints are placed on the possible values for the probabilities, however, it becomes much more difficult to deal with. Model checking and checking for prior-data…

The Collatz conjecture is explored using polynomials based on a binary numeral system. It is shown that the degree of the polynomials, on average, decreases after a finite number of steps of the Collatz operation, which provides a weak…

We introduce a variant of the $k$-nearest neighbor classifier in which $k$ is chosen adaptively for each query, rather than supplied as a parameter. The choice of $k$ depends on properties of each neighborhood, and therefore may…

We begin the study of how to extend few variable means to several variable ones and how to shrink means of several variables to less variables. With the help of one of the techniques we show that it is enough to check an inequality between…

We introduce a finite difference and $q$-difference analogues of the Asymptotic Iteration Method of Ciftci, Hall, and Saad. We give necessary, and sufficient condition for the existence of a polynomial solution to a general linear…

The objective of this work is the construction of `Boyd-Wong fixed point theorem' in the setting of generalized parametric metric space and discussion its application on existence criteria of solutions to a second order initial value…

Given a bilinear (or sub-bilinear) operator $B$, we prove restricted weighted weak type inequalities of the form $$ ||B(f_1, f_2)||_{L^{p, \infty}(w_1^{p/p_1}w_2^{p/p_2})}\lesssim ||f_1||_{L^{p_1, 1}(w_1)}||f_2||_{L^{p_2, 1}(w_2)}, $$…

Chang's Lemma is a widely employed result in additive combinatorics. It gives bounds on the dimension of the large spectrum of probability distributions on finite abelian groups. Recently, Bloom (2016) presented a powerful variant of…