Related papers: A descriptive approach to higher derived limits
We consider a subclass of tilings, the tilings obtained by cut and projection. Under somewhat standard assumptions, we show that the natural complexity function has polynomial growth. We compute its exponent \alpha in terms of the ranks of…
Topological mapping of a large physical system on a graph, and its decomposition using universal measures is proposed. We find inherent limits to the potential for optimization of a given system and its approximate representations by…
In this paper we present a finite element method for the direct transcription of constrained non-linear optimal control problems. We prove that our method converges of high order under mild assumptions. Our analysis uses a regularized…
A canonical formalism for higher-derivative theories is presented on the basis of Dirac's method for constrained systems. It is shown that this formalism shares a path integral expression with Ostrogradski's canonical formalism.
In this book we construct fundamental filtered complexes in filtered derived categories. These are generalizations of a filtered complex constructed by Mokrane. As an application of these constructions, we develop theory of limits of weight…
We develop a theory of limits for sequences of dense abstract simplicial complexes, where a sequence is considered convergent if its homomorphism densities converge. The limiting objects are represented by stacks of measurable [0,1]-valued…
We extend some recent results on the differentiability of torsion theories. In particular, we generalize the concept of $(\alpha, \beta)$-derivation to $(\alpha, \beta)$-higher derivation and demonstrate that a filter of a hereditary…
Recovering the underlying Directed Acyclic Graph (DAG) structures from observational data presents a formidable challenge, partly due to the combinatorial nature of the DAG-constrained optimization problem. Recently, researchers have…
The derived functors $\lim^n$ of the inverse limit are widely studied for their topological applications, among which are some repercussions on the additivity of strong homology. Set theory has proven useful in dealing with these functors,…
Dickson's Lemma is a simple yet powerful tool widely used in termination proofs, especially when dealing with counters or related data structures. However, most computer scientists do not know how to derive complexity upper bounds from such…
We consider a driven tagged particle in a symmetric exclusion process on Z with a removal rule. In this process, untagged particles are removed once they jump to the left of the tagged particle. We investigate the behavior of the…
We show new upper and lower bounds for the complexity of implementation of a sequence of Boolean matrices proposed by Kaski et al. (arXiv:1208.0554) with additive circuits.
Several complexity measures such as degree, sparsity and multiplicative index for cryptographic functions including the Diffie-Hellman mapping and the discrete logarithm in a finite field have been studied in the literature. In 2022, Reis…
Linear differential equations and recurrences reveal many properties about their solutions. Therefore, these equations are well-suited for representing solutions and computing with special functions. We identify a large class of existing…
A lot of well-known functors such as group homology, cyclic homology of algebras can be described as limits of certain simply defined functors over categories of presentations. In this paper, we develop technique for the description of the…
We introduce a new notion of complexity of functions and we show that it has the following properties: (i) it governs a PAC Bayes-like generalization bound, (ii) for neural networks it relates to natural notions of complexity of functions…
Many modern numerical methods in computational science and engineering rely on derivatives of mathematical models for the phenomena under investigation. The computation of these derivatives often represents the bottleneck in terms of…
We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…
It is well-known that the coefficients in Faa di Bruno's chain rule for higher derivatives can be expressed via numeration of partitions. It turns out that this has a natural form as a formula for the vector case. To this formula two proofs…
A modal logic that is strong enough to fully characterize the behavior of a system is called expressive. Recently, with the growing diversity of systems to be reasoned about (probabilistic, cyber-physical, etc.), the focus shifted to…