Related papers: Topological Complexity of omega-Powers : Extended …
A survey paper on some recent results on additive problems with prime powers.
We obtain Szeg\H o-type limit theorems for Toeplitz operators on the weighted Bergman spaces $A^{2}_{\alpha}(\mathbb{B}^{n})$, and on $L^{2}(G)$, presenting separate formulations for compact and locally compact Abelian groups. Furthermore,…
This is a supplement to the article "Markov Chain Monte Carlo Based on Deterministic Transformations" available at http://arxiv.org/abs/1106.5850
Effective field theories consistent with quantum gravity obey surprising finiteness constraints, appearing in several distinct but interconnected forms. In this work we develop a framework that unifies these observations by proposing that…
We present a new approach to equivariant version of the topological complexity, called a symmetric topological complexity. It seems that the presented approach is more adequate for the analysis of an impact of symmetry on the the motion…
This paper briefly summarizes previous work on complex classical mechanics and its relation to quantum mechanics. It then introduces a previously unstudied area of research involving the complex particle trajectories associated with…
We comment on a recent paper by D'Abramo [Chaos, Solitons & Fractals, 25 (2005) 29], focusing on the author's statement that an algorithm can produce a list of strings containing at least one string whose algorithmic complexity is greater…
We consider dynamical systems for which the spatial extension plays an important role. For these systems, the notions of attractor, epsilon-entropy and topological entropy per unit time and volume have been introduced previously. In this…
Clones of operations of arity omega (referred to as omega-operations) have been employed by Neumann to represent varieties of infinitary algebras defined by operations of at most arity omega. More recently, clone algebras have been…
This paper gives a concise introduction into the basic theory of {\omega}-automata (as of March 2014). The starting point are the different types of recurrence conditions, modes of operation (deterministic, nondeterministic, alternating…
In the present note, we study a new method of constructing efficient coverings for Kronecker powers of matrices, recently proposed by J. Alman, Y. Guan, A. Padaki [arXiv, 2022]. We provide an alternative proof for the case of symmetric…
These lecture notes are an informal introduction to the theory of computational complexity and its links to quantum computing and statistical mechanics.
These are lecture notes from my talks at the "Current Developments in Mathematics" conference (Harvard, 2006). They cover a variety of topics involving symplectic cohomology. In particular, a discussion of (algorithmic) classification…
We study the links between the topological complexity of an omega context free language and its degree of ambiguity. In particular, using known facts from classical descriptive set theory, we prove that non Borel omega context free…
In this work we have considered the complexity of the different structures as topological group on Z. We collect some new results, as well as some known results on the group of the integers in order to present: -A family of $2^\cont$…
This article is a survey on the topic of polynomial amoebas. We review results of papers written on the topic with an emphasis on its computational aspects. Polynomial amoebas have numerous applications in various domains of mathematics and…
When applying optimization method to a real-world problem, the possession of prior knowledge and preliminary analysis on the landscape of a global optimization problem can give us an insight into the complexity of the problem. This…
In 2012, Diem introduced a new figure of merit for cryptographic sequences called expansion complexity. In this paper, we slightly modify this notion to obtain the so-called irreducible-expansion complexity which is more suitable for…
$N$-complexes have been argued recently to be algebraic structures relevant to the description of higher spin gauge fields. $N$-complexes involve a linear operator $d$ that fulfills $d^N = 0$ and that defines a generalized cohomology. Some…
We formalise, in Coq, the opening sections of Parity Complexes [Street1991] up to and including the all important excision of extremals algorithm. Parity complexes describe the essential combinatorial structure exhibited by simplexes, cubes…