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

In the case of monotone independence, the transparent understanding of the mechanism to validate the central limit theorem (CLT) has been lacking, in sharp contrast to commutative, free and Boolean cases. We have succeeded in clarifying it…

In this work, we will prove a uniqueness result for Calder\'on's inverse problem via some integral representation formulas for solutions of the Vekua equation in the framework of Clifford analysis.

Let $K_{q^n}(a)$ be a Kloosterman sum over the finite field $\F_{q^n}$ of characteristic $p$. In this note so called subfield conjecture is proved in case $p>3$: if $a\ne0$ belongs to the proper subfield $\F_q$ of $\F_{q^n}$, then…

We prove a Kotake-Narasimhan type theorem in general ultradifferentiable classes given by weight matrices. In doing so we simultaneously recover and partially generalize the known results for classes given by weight sequences and weight…

We establish new results of first-order necessary conditions of optimality for finite-dimensional problems with inequality constraints and for problems with equality and inequality constraints, in the form of John's theorem and in the form…

We construct new families of (q-) difference and (contour) integral operators having nice actions on Koornwinder's multivariate orthogonal polynomials. We further show that the Koornwinder polynomials can be constructed by suitable…

The weight enumerators (quant-ph/9610040) of a quantum code are quite powerful tools for exploring its structure. As the weight enumerators are quadratic invariants of the code, this suggests the consideration of higher-degree polynomial…

Error-correcting codes have an important role in data storage and transmission and in cryptography, particularly in the post-quantum era. Hermitian matrices over finite fields and equipped with the rank metric have the potential to offer…

We give an elementary proof of the Kontsevich conjecture that asserts that the iterations of the noncommutative rational map K_r:(x,y)-->(xyx^{-1},(1+y^r)x^{-1}) are given by noncommutative Laurent polynomials.

We answer the following long-standing question of Kolchin: given a system of algebraic-differential equations $\Sigma(x_1,\dots,x_n)=0$ in $m$ derivatives over a differential field of characteristic zero, is there a computable bound, that…

We study the strength of axioms needed to prove various results related to automata on infinite words and B\"uchi's theorem on the decidability of the MSO theory of $(N, {\le})$. We prove that the following are equivalent over the weak…

This is the second combinatorial proof of the compactness theorem for singular from 1977. In fact it gives a somewhat stronger theorem.

Computational indistinguishability is a key property in cryptography and verification of security protocols. Current tools for proving it rely on cryptographic game transformations. We follow Bana and Comon's approach, axiomatizing what an…

A theorem of Kaplansky asserts that a semigroup of matrices with entries from a field whose members all have singleton spectra is triangularizable. Indeed, Kaplansky's Theorem unifies well-known theorems of Kolchin and Levitzki on…

A multivariate Gauss-Lucas theorem is proved, sharpening and generalizing previous results on this topic. The theorem is stated in terms of a seemingly new notion of convexity. Applications to multivariate stable polynomials are given.

We establish a connection between a specialization of the nonsymmetric Macdonald polynomials and the Demazure characters of the corresponding affine Kac-Moody algebra. This allows us to obtain a representation-theoretical interpretation of…

In this short note we present a simple counterexample to a nonlinear version of the Krein-Rutman theorem reported in [Nonlinear Anal. 11 (2007), 3084-3090]. Correct versions of this theorem, and related results for superadditive maps are…

This article is the last in a series of three papers, whose scope is to give new proofs to the well known theorems of Calder\'{o}n, Coifman, McIntosh and Meyer. Here we extend the results of the previous two papers to the polydisc setting.…

In this paper we propose a revisitation of the topic of unique decodability and of some fundamental theorems of lossless coding. It is widely believed that, for any discrete source X, every "uniquely decodable" block code satisfies E[l(X_1…

We introduce twisted unitary $t$-groups, a generalization of unitary $t$-groups under a twisting by an irreducible representation. We then apply representation theoretic methods to the Knill-Laflamme error correction conditions to show that…