English
Related papers

Related papers: An additivity theorem for plain Kolmogorov complex…

200 papers

An explicit formula for a strong connection form in a principal extension by a coseparable coalgebra is given.

Quantum Algebra · Mathematics 2007-05-23 E. J. Beggs , Tomasz Brzezinski

An explicit formula for the $A$-polynomial of the knot having Conway's notation $C(2n,4)$ is computed up to repeated factors. Our polynomial contains exactly the same irreducible factors as the $A$-polynomial defined in~\cite{CCGLS1}.

Geometric Topology · Mathematics 2022-12-27 Ji-Young Ham , Joongul Lee

Let $X$ be a Cantor set, and let $A$ be a unital separable simple amenable $C$*-algebra with tracial rank zero which satisfies the Universal Coefficient Theorem, we use $C(X,A)$ to denote the set of all continuous functions from $X$ to $A$,…

Operator Algebras · Mathematics 2010-06-08 Jiajie Hua

We generalize the asymptotic estimates by Bubboloni, Luca and Spiga (2012) on the number of $k$-compositions of $n$ satisfying some coprimality conditions. We substantially refine the error term concerning the number of $k$-compositions of…

Number Theory · Mathematics 2021-05-31 László Tóth

The complexity of a module is the rate of growth of the minimal projective resolution of the module while the $z$-complexity is the rate of growth of the number of indecomposable summands at each step in the resolution. Let…

Representation Theory · Mathematics 2017-03-21 Houssein El Turkey

We define the notion of componentwise regularity and study some of its basic properties. We prove an analogue, when working with weight orders, of Buchberger's criterion to compute Gr\"obner bases; the proof of our criterion relies on a…

Commutative Algebra · Mathematics 2013-08-28 Giulio Caviglia , Matteo Varbaro

A selection of the relevant theorems of Probability Theory that comes directly from Kolmogorov's axioms, Set Theory basic results, definitions and rules of inference are listed and proven in a systematic approach, aiming the student who…

General Mathematics · Mathematics 2022-06-14 Diego J. Raposo

We consider the problem of computing the Euler characteristic of an abstract simplicial complex given by its vertices and facets. We show that this problem is #P-complete and present two new practical algorithms for computing Euler…

Computational Geometry · Computer Science 2011-12-21 Bjarke Hammersholt Roune , Eduardo Sáenz de Cabezón

The question of integer complexity asks about the minimal number of $1$'s that are needed to express a positive integer using only addition and multiplication (and parentheses). In this paper, we propose the notion of $l$-complexity of…

Number Theory · Mathematics 2025-10-28 Pengcheng Zhang

The paper presents a classification theorem for the class of flat connections with triangular (0,1)-components on a topologically trivial complex vector bundle over a compact Kahler manifold. As a consequence we obtain several results on…

Differential Geometry · Mathematics 2007-05-23 Alexander Brudnyi

We establish an analytic proof for the Krylov $C^{1,1}$ estimates for solutions of degenerate complex Monge-Amp\`ere equation. We also provide an analytic proof of the Bedford-Taylor interior $C^{1,1}$ estimate.

Complex Variables · Mathematics 2025-07-30 Sławomir Dinew , Marcin Sroka

We show generic existence of power series a with complex coefficients a_n, such that the sequence of partial sums of a new power series where its coefficients b_n are functions of a_0, a_1, ..., a_n approximate every polynomial uniformly on…

Complex Variables · Mathematics 2019-06-05 Konstantinos Maronikolakis , Vassili Nestoridis

Motivated by the problem of finding finite versions of classical incompleteness theorems, we present some conjectures that go beyond ${\bf NP\neq co NP}$. These conjectures formally connect computational complexity with the difficulty of…

Logic · Mathematics 2017-05-22 Pavel Pudlak

The past research on the state complexity of operations on regular languages is examined, and a new approach based on an old method (derivatives of regular expressions) is presented. Since state complexity is a property of a language, it is…

Formal Languages and Automata Theory · Computer Science 2009-07-28 Janusz Brzozowski

For a compact subset $K$ of a closed symplectic manifold $(M, \omega)$, we prove that $K$ is heavy if and only if its relative symplectic cohomology over the Novikov field is non-zero. As an application we show that if two compact sets are…

Symplectic Geometry · Mathematics 2024-03-14 Cheuk Yu Mak , Yuhan Sun , Umut Varolgunes

In this expository paper, various properties of matrix traces, determinants and adjugate matrices are proved, including the *trace Cayley-Hamilton theorem*, which says that \[ kc_k + \sum_{i=1}^k \operatorname{Tr} (A^i) c_{k-i} = 0 \qquad…

Rings and Algebras · Mathematics 2026-04-15 Darij Grinberg

We provide two proofs of the compactness theorem for extensions of first-order logic based on team semantics. First, we build upon L\"uck's ultraproduct construction for team semantics and prove a suitable version of {\L}o\'s' Theorem.…

Logic · Mathematics 2025-01-24 Joni Puljujärvi , Davide Emilio Quadrellaro

We introduce the notion of a complex cell, a complexification of the cells/cylinders used in real tame geometry. For $\delta\in(0,1)$ and a complex cell $\mathcal{C}$ we define its holomorphic extension…

Complex Variables · Mathematics 2019-04-19 Gal Binyamini , Dmitry Novikov

Motivated by Shokurov's ACC Conjecture for log canonical thresholds, we propose an inductive point of view on singularities of pairs, in the case when the ambient variety is smooth. Our main result characterizes the log canonicity of a pair…

Algebraic Geometry · Mathematics 2010-04-23 Mircea Mustata

Cumulants are a notion that comes from the classical probability theory, they are an alternative to a notion of moments. We adapt the probabilistic concept of cumulants to the setup of a linear space equipped with two multiplication…

Combinatorics · Mathematics 2021-06-03 Adam Burchardt