English
Related papers

Related papers: Kolmogorov structure functions for automatic compl…

200 papers

The classical ``$H=W$" theorem establishes the identity between two function spaces on an arbitrary nonempty open set in the Euclidean spaces: the space $W$ defined via weak derivatives, and the space $H$ defined as the closure of smooth…

Functional Analysis · Mathematics 2026-05-07 Zhouzhe Wang , Jiayang Yu , Xu Zhang , Shiliang Zhao

A cellular automaton is presented whose governing rule is that the Kolmogorov complexity of a cell's neighborhood may not increase when the cell's present value is substituted for its future value. Using an approximation of this…

Information Theory · Computer Science 2017-10-05 Bar Y. Peled , Vikas K. Mishra , Avishy Y. Carmi

We prove a theorem which provides a method for constructing points on varieties defined by certain smooth functions. We require that the functions are definable in a definably complete expansion of a real closed field and are locally…

Logic · Mathematics 2014-02-26 G. O. Jones , A. J. Wilkie

Let $\mathbf{K}$ be the class of countable structures $M$ with the strong small index property and locally finite algebraicity, and $\mathbf{K}_*$ the class of $M \in \mathbf{K}$ such that $acl_M(\{ a \}) = \{ a \}$ for every $a \in M$. For…

Logic · Mathematics 2018-08-31 Gianluca Paolini , Saharon Shelah

We offer a criterion for showing that the automorphism group of an ultrahomogeneous structure is topologically 2-generated and even has a cyclically dense conjugacy class. We then show how finite topological rank of the automorphism group…

Group Theory · Mathematics 2019-08-26 Itay Kaplan , Pierre Simon

The theory of abstract argumentation frameworks (afs) has, in the main, focused on finite structures, though there are many significant contexts where argumentation can be regarded as a process involving infinite objects. To address this…

Artificial Intelligence · Computer Science 2018-10-12 Pietro Baroni , Federico Cerutti , Paul E. Dunne , Massimiliano Giacomin

Using infinite compositions, we solve the general equations $P(\lambda w) = p(w)f(P(w))$ for holomorphic functions $p$ and $f$. We describe the situations in which this equation is palpable; and their effectiveness at describing dynamical…

Complex Variables · Mathematics 2021-09-01 James David Nixon

The decompositions of an element of a finite von Neumann algebra into the sum of a normal operator plus an s.o.t.-quasinilpotent operator, obtained using the Haagerup--Schultz hyperinvariant projections, behave well with respect to…

Operator Algebras · Mathematics 2013-10-10 Ken Dykema , Fedor Sukochev , Dmitriy Zanin

In this work, we introduce the notion of decisional width of a finite relational structure and the notion of decisional width of a regular class of finite structures. Our main result states that given a first-order formula {\psi} over a…

Logic in Computer Science · Computer Science 2021-04-22 Alexsander Andrade de Melo , Mateus de Oliveira Oliveira

Let $\Omega_1,\Omega_2$ be two disjoint open sets in $\mathbf C^n$ whose boundaries share a smooth real hypersurface $M$ as relatively open subsets. Assume that $\Omega_i$ is equipped with a complex structure $J^i$ which is smooth up to…

Complex Variables · Mathematics 2010-08-09 Florian Bertrand , Xianghong Gong , Jean-Pierre Rosay

The definition of conservative-irreversible functions is extended to smooth manifolds. The local representation of these functions is studied and reveals that not each conservative-irreversible function is given by the weighted product of…

Mathematical Physics · Physics 2024-04-09 Dan Goreac , Jonas Kirchhoff , Bernhard Maschke

Parabolic integro-differential Kolmogorov equations with different space-dependent operators are considered in H\"{o}lder-type spaces defined by a scalable L\'{e}vy measure. Probabilistic representations are used to prove continuity of the…

Probability · Mathematics 2018-10-04 Fanhui Xu

We show that descriptive complexity's result extends in High Order Logic to capture the expressivity of Turing Machine which have a finite number of alternation and whose time or space is bounded by a finite tower of exponential. Hence we…

Logic in Computer Science · Computer Science 2014-07-16 Arthur Milchior

For any limit ordinal $\lambda$, we construct a linear order $L_\lambda$ whose Scott complexity is $\Sigma_{\lambda+1}$. This completes the classification of the possible Scott sentence complexities of linear orderings. Previously, there…

Logic · Mathematics 2024-06-05 David Gonzalez , Matthew Harrison-Trainor , Meng-Che "Turbo" Ho

The \emph{index set} of a computable structure $\mathcal{A}$ is the set of indices for computable copies of $\mathcal{A}$. We determine the complexity of the index sets of various mathematically interesting structures, including arbitrary…

Logic · Mathematics 2008-03-25 Wesley Calvert , Valentina S. Harizanov , Julia F. Knight , Sara Miller

Recently, Schlicht and Stephan lifted the notion of automatic-structures to the notion of (finite-word) ordinal-automatic structures. These are structures whose domain and relations can be represented by automata reading finite words whose…

Formal Languages and Automata Theory · Computer Science 2014-10-21 Alexander Kartzow

Composition operators with analytic symbols on some reproducing kernel Hilbert spaces of entire functions on a complex Hilbert space are studied. The questions of their boundedness, seminormality and positivity are investigated. It is…

Functional Analysis · Mathematics 2016-10-17 Jan Stochel , Jerzy B. Stochel

For certain families of compact subsets of the plane, the isomorphism class of the algebra of absolutely continuous functions on a set is completely determined by the homeomorphism class of the set. This is analogous to the…

Functional Analysis · Mathematics 2021-05-31 Shaymaa Al-shakarchi , Ian Doust

A hypergeometric type equation satisfying certain conditions defines either a finite or an infinite system of orthogonal polynomials. We present in a unified and explicit way all these systems of orthogonal polynomials, the associated…

Quantum Physics · Physics 2009-11-10 Nicolae Cotfas

Solving polynomial systems arising from applications is frequently made easier by the structure of the systems. Weighted homogeneity (or quasi-homogeneity) is one example of such a structure: given a system of weights…

Symbolic Computation · Computer Science 2015-12-22 Jean-Charles Faugère , Mohab Safey El Din , Thibaut Verron