Related papers: On McMillan's theorem about uniquely decipherable …

We study unitary representations of groups in Krein spaces, irreducibility criteria and integral decompositions. Our main tool is the theory of Krein subspaces and their (reproducing) kernels and a variant of Choquet's theorem.

We prove a sharp version of Hal\'asz's theorem on sums $\sum_{n \leq x} f(n)$ of multiplicative functions $f$ with $|f(n)|\le 1$. Our proof avoids the "average of averages" and "integration over $\alpha$" manoeuvres that are present in many…

The paper presents several combinatorial properties of the boolean cumulants. A corollary is a new proof of the multiplicative property of the boolean cumulant series that can be easily adapted for the case of boolean independence with…

Kerov's polynomials give irreducible character values in term of the free cumulants of the associated Young diagram. We prove in this article a positivity result on their coefficients, which extends a conjecture of S. Kerov. Our method,…

We prove that the sequence of MacLane key polynomials constructed in \cite{Mac1} and \cite{Sp2} for a valuation extension $(K,\nu)\subset (K(x),\mu)$ is finite, provided that both $\nu$ and $\mu$ are divisorial and $\mu$ is centered over an…

This paper introduces a uniform substitution calculus for differential refinement logic dRL. The logic dRL extends the differential dynamic logic dL such that one can simultaneously reason about properties of and relations between hybrid…

The central purpose of this article is to establish new inverse and implicit function theorems for differentiable maps with isolated critical points. One of the key ingredients is a discovery of the fact that differentiable maps with…

Turing's famous 'machine' framework provides an intuitively clear conception of 'computing with real numbers'. A recursive counterexample to a theorem shows that the theorem does not hold when restricted to computable objects. These…

We show that certain determinantal functions of multiple matrices, when summed over the symmetries of the cube, decompose into functions of the original matrices. These are shown to be true in complete generality; that is, no properties of…

Irreducible cyclic codes are an interesting type of codes and have applications in space communications. They have been studied for decades and a lot of progress has been made. The objectives of this paper are to survey and extend earlier…

Many proofs in discrete mathematics and theoretical computer science are based on the probabilistic method. To prove the existence of a good object, we pick a random object and show that it is bad with low probability. This method is…

Using a sums of squares formula for two variable polynomials with no zeros on the bidisk, we are able to give a new proof of a representation for distinguished varieties. For distinguished varieties with no singularities on the two-torus,…

We establish the Caffarelli-Kohn-Nirenberg type inequalities involving{ super-logarithms (infinitely iterated logarithms).} As a result the critical Caffarelli-Kohn-Nirenberg type inequalities will be improved, and in certain cases the best…

Recently, several proofs of the Mason--Welsh conjecture for matroids have been found, which asserts the log-concavity of the sequence that counts independent sets of a given size. In this article we use the theory of Lorentzian polynomials,…

Watson proved Kirkman's hypothesis (partially solved by Cayley). Using Lagrange Inversion, we drastically shorten Watson's computations and generalize his results at the same time.

We prove that irreducible complex representations of finitely generated nilpotent groups are monomial if and only if they have finite weight, which was conjectured by Parshin. Note that we consider (possibly, infinite-dimensional)…

Let $p$ be a multilinear polynomial in several non-commuting variables with coefficients in an arbitrary field $K$. Kaplansky conjectured that for any $n$, the image of $p$ evaluated on the set $M_n(K)$ of $n$ by $n$ matrices is either…

We study the distribution of partial sums of Rademacher random multiplicative functions $(f(n))_n$ evaluated at polynomial arguments. We show that for a polynomial $P\in \mathbb Z[x]$ that is a product of at least two distinct linear…

We propose a new conjecture on some exponential sums. These particular sums have not apparently been considered in the literature. Subject to the conjecture we obtain the first effective construction of asymptotically good tree codes. The…

We consider the strength and effective content of restricted versions of Hindman's Theorem in which the number of colors is specified and the length of the sums has a specified finite bound. Let $\mathsf{HT}^{\leq n}_k$ denote the assertion…