English
Related papers

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

200 papers

We prove that the inverse of a positive-definite matrix can be approximated by a weighted-sum of a small number of matrix exponentials. Combining this with a previous result [OSV12], we establish an equivalence between matrix inversion and…

Data Structures and Algorithms · Computer Science 2016-08-23 Sushant Sachdeva , Nisheeth K. Vishnoi

Kolmogorov's invariant torus theorem is proved using a simple fixed point theorem.

Dynamical Systems · Mathematics 2015-05-27 Jacques Féjoz

We establish an invertibility criterion for free polynomials and free functions evaluated on some tuples of matrices. We show that if the derivative is nonsingular on some domain closed with respect to direct sums and similarity, the…

Functional Analysis · Mathematics 2014-07-01 J. E. Pascoe

We show that Morley's theorem on the number of countable models of a countable first-order theory becomes an undecidable statement when extended to second-order logic. More generally, we calculate the number of equivalence classes of…

Logic · Mathematics 2023-07-06 Christopher J. Eagle , Clovis Hamel , Sandra Müller , Franklin D. Tall

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…

Computational Complexity · Computer Science 2014-08-19 Robert L. Surowka , Kenneth W. Regan

Let (K, v) be a henselian valued field of arbitrary rank. In this paper, we give an irreducibility criterion for multivariate polynomials over K using valuation theory.

Commutative Algebra · Mathematics 2016-12-07 Anuj Jakhar

Driven by the interest of reasoning about probabilistic programming languages, we set out to study a notion of unicity of normal forms for them. To provide a tractable proof method for it, we define a property of distribution confluence…

Logic in Computer Science · Computer Science 2018-11-06 Alejandro Díaz-Caro , Guido Martínez

In this Note, we present a Calder\'on-type uniqueness theorem on the Cauchy problem of stochastic partial differential equations. To this aim, we introduce the concept of stochastic pseudo-differential operators, and establish their…

Probability · Mathematics 2010-11-30 Xu Liu , Xu Zhang

In this article we provide with combinatorial proofs of some recent identities due to Sury and McLaughlin. We show that, the solution of a general linear recurrence with constant coefficients can be interpreted as a determinant of a matrix.…

Combinatorics · Mathematics 2020-09-15 Sudip Bera

In a recent paper, Merca posed three conjectures on congruences for specific convolutions of a sum of odd divisor functions with a generating function for generalized $m$-gonal numbers. Extending Merca's work, we complete the proof of these…

Number Theory · Mathematics 2021-07-22 Kaya Lakein , Anne Larsen

The Titchmarsh convolution theorem is a celebrated result about the support of the convolution of two functions. We present a simple proof based on the canonical factorization theorem for bounded holomorphic functions on the unit disk.

Complex Variables · Mathematics 2020-11-12 Thomas Ransford

As applications of Kadison's Pythageorean and carpenter's theorems, the Schur-Horn theorem, and Thompson's theorem, we obtain an extension of Thompsons theorem to compact operators and use these ideas to give a characterization of diagonals…

Functional Analysis · Mathematics 2018-02-28 John Jasper , Jireh Loreaux , Gary Weiss

Products, multiplicative Chern characters, and finite coefficients, are unarguably among the most important tools in algebraic K-theory. Although they admit numerous different constructions, they are not yet fully understood at the…

K-Theory and Homology · Mathematics 2011-01-12 Goncalo Tabuada

We prove that the existence of an automorphism of finite order on a (defined over a number field) variety X implies the existence of algebraic linear relations between the logarithm of certain periods of X and the logarithm of special…

Number Theory · Mathematics 2007-05-23 V. Maillot , D. Roessler

We show that there exists a bitsequence that is not computably random for which its odd bits are computably random and its even bits are computably random relative to the odd bits. This implies that the uniform variant of van Lambalgen's…

Logic · Mathematics 2019-11-13 Bruno Bauwens

The unique determination of a measurable conductivity from the Dirichlet-to-Neumann map of the equation $\mathrm{div} (\sigma \nabla u) = 0$ is the subject of this note. A new strategy, based on Clifford algebras and a higher dimensional…

Analysis of PDEs · Mathematics 2019-06-26 Matteo Santacesaria

In this paper we obtain some refinements of a well-known result of Enestr\"o-Kakeya concerning the bounds for the moduli of the zeros of polynomials with complex coefficients which improve upon some results due to Aziz and Mohammad, Govil…

Complex Variables · Mathematics 2015-11-10 N. A. Rather , Suhail Gulzar , S. H. Ahangar

We consider the reconstruction of the support of an unknown perturbation to a known conductivity coefficient in Calder\'on's problem. In a previous result by the authors on monotonicity-based reconstruction, the perturbed coefficient is…

Analysis of PDEs · Mathematics 2022-08-24 Henrik Garde , Nuutti Hyvönen

Using cyclotomic specializations of the equivariant $K$-theory with respect to a torus action we derive congruences for discrete invariants of exceptional objects in derived categories of coherent sheaves on a class of varieties that…

Algebraic Geometry · Mathematics 2008-09-09 Alexander Polishchuk

A theorem of Thompson provides a non-self-adjoint variant of the classical Schur-Horn theorem by characterizing the possible diagonal values of a matrix with given singular values. We prove an analogue of Thompson's theorem for II_1…

Operator Algebras · Mathematics 2017-05-09 Matthew Kennedy , Paul Skoufranis