Related papers: Linear independence criteria for generalized polyl…
The Lopsided Lov\'{a}sz Local Lemma (LLLL) is a powerful probabilistic principle which has been used in a variety of combinatorial constructions. While originally a general statement about probability spaces, it has recently been…
We characterize unicyclic graphs that are singular using the support of the null space of their pendant trees. From this, we obtain closed formulas for the independence and matching numbers of a unicyclic graph, based on the support of its…
After H\"older proved his classical theorem about the Gamma function, there has been a whole bunch of results showing that solutions to linear difference equations tend to be hypertranscendental i.e. they cannot be solution to an algebraic…
Given a finite subset S in F_p^d, let a(S) be the number of distinct r-tuples (x_1,...,x_r) in S such that x_1+...+x_r = 0. We consider the "moments" F(m,n) = sum_|S|=n a(S)^m. Specifically, we present an explicit formula for F(m,n) as a…
We introduce a generalized version of the local Lipschitz number $\textrm{lip}\,u$, and show that it can be used to characterize Sobolev functions $u\in W_{\textrm{loc}}^{1,p}(\mathbb R^n)$, $1\le p\le \infty$, as well as functions of…
Limit theorems for non-additive probabilities or non-linear expectations are challenging issues which have raised progressive interest recently. The purpose of this paper is to study the strong law of large numbers and the law of the…
The smoothed analysis of algorithms is concerned with the expected running time of an algorithm under slight random perturbations of arbitrary inputs. Spielman and Teng proved that the shadow-vertex simplex method has polynomial smoothed…
In a previous article we had proved an algebraicity result for the central critical value for L-functions for GL(n) x GL(n-1) over Q assuming the validity of a nonvanishing hypothesis involving archimedean integrals. The purpose of this…
We prove various theorems on approximation using polynomials with integer coefficients in the Bernstein basis of any given order. In the extreme, we draw the coefficients from $\{ \pm 1\}$ only. A basic case of our results states that for…
We define discrete generating series for arbitrary functions \( f \colon \mathbb{Z}^n \rightarrow \mathbb{C} \) and derive functional relations that these series satisfy. For linear difference equations with constant coefficients, we…
The problem of finding independent components of an indexed object (e.g., a tensor) with arbitrary number of indices and arbitrary linear symmetries is discussed. It is proved that the number of independent components $f(k)$ is a polynomial…
The study of Locally Checkable Labelings (LCLs) has led to a remarkably precise characterization of the distributed time complexities that can occur on bounded-degree trees. A central feature of this complexity landscape is the existence of…
Non-linearity of a Boolean function indicates how far it is from any linear function. Despite there being several strong results about identifying a linear function and distinguishing one from a sufficiently non-linear function, we found a…
In this paper we develop techniques that eliminate the need of the Generalized Riemann Hypothesis (GRH) from various (almost all) known results about deterministic polynomial factoring over finite fields. Our main result shows that given a…
We consider polynomial maps described by so-called "(multivariate) linearized polynomials". These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps…
Maximon has recently given an excellent summary of the properties of the Euler dilogarithm function and the frequently used generalizations of the dilogarithm, the most important among them being the polylogarithm function $Li_(z)$. The…
Let $R$ be a finite non-commutative ring with $1\ne 0$. By a polynomial function on $R$, we mean a function $F\colon R\longrightarrow R$ induced by a polynomial $f=\sum\limits_{i=0}^{n}a_ix^i\in R[x]$ via right substitution of the variable…
Iteration complexities for optimizing smooth functions with first-order algorithms are typically stated in terms of a global Lipschitz constant of the gradient, and near-optimal results are then achieved using fixed step sizes. But many…
The classic Schneider-Lang theorem in transcendence theory asserts that there are only finitely many points at which algebraically independent complex meromorphic functions of finite order of growth can simultaneously take values in a…
Using the same heuristic argument leading to the Lang-Waldschmidt Conjecture in the theory of linear forms in logarithms, we formulate an effective version of the Linear Independence conjecture for the ordinates of the non-trivial zeros of…