Related papers: Boundary complexity and surface entropy of 2-multi…
Topological entropy or spatial entropy is a way to measure the complexity of shift spaces. This study investigates the relationships between the spatial entropy and the various periodic entropies which are computed by skew-coordinated…
We propose and analyze a two-level method for mimetic finite difference approximations of second order elliptic boundary value problems. We prove that the two-level algorithm is uniformly convergent, i.e., the number of iterations needed to…
We study entropy-bounded computational geometry, that is, geometric algorithms whose running times depend on a given measure of the input entropy. Specifically, we introduce a measure that we call range-partition entropy, which unifies and…
Complexity measures are essential to understand complex systems and there are numerous definitions to analyze one-dimensional data. However, extensions of these approaches to two or higher-dimensional data, such as images, are much less…
We use the complexity function of an invariant, not necessary closed, subset of a two-sided shift space to compute the polynomial entropy of the induced dynamics on the hyperspace of continua for certain one-dimensional dynamical systems.…
Almost asymptotically tight lower bounds are derived for the Input/Output (I/O) complexity $IO_\mathcal{A}\left(n,M\right)$ of a general class of hybrid algorithms computing the product of two integers, each represented with $n$ digits in a…
This paper presents a method to certify the computational complexity of a standard Branch and Bound method for solving Mixed-Integer Quadratic Programming (MIQP) problems defined as instances of a multi-parametric MIQP. Beyond previous…
Characterizing complexity and criticality in quantum systems requires diagnostics that are both computationally tractable and physically insightful. We apply a measure of quantum state complexity for n-qubit systems, defined as the…
This work presents a generalized boundary integral method for elliptic equations on surfaces, encompassing both boundary value and interface problems. The method is kernel-free, implying that the explicit analytical expression of the kernel…
Elliptic curve multiplications can be improved by replacing the standard ladder algorithm's base 2 representation of the scalar multiplicand, with mixed-base representations with power-of-2 bases, processing the n bits of the current digit…
For a static time slice of AdS$_3$ we describe a particular class of minimal surfaces which form trivalent networks of geodesics. Through geometric arguments we provide evidence that these surfaces describe a measure of multipartite…
We study local symmetry breaking problems in the CONGEST model, focusing on ruling set problems, which generalize the fundamental Maximal Independent Set (MIS) problem. A $\beta$-ruling set is an independent set such that every node in the…
The dynamics of symbolic systems, such as multidimensional subshifts of finite type or cellular automata, are known to be closely related to computability theory. In particular, the appropriate tools to describe and classify topological…
We give the first quasipolynomial upper bound $\phi n^{\text{polylog}(n)}$ for the smoothed complexity of the SWAP algorithm for local Graph Partitioning (also known as Bisection Width), where $n$ is the number of nodes in the graph and…
This work contains two single-letter upper bounds on the entropy rate of a discrete-valued stationary stochastic process, which only depend on second-order statistics, and are primarily suitable for models which consist of relatively large…
We consider a two-parameter family of random substitutions and show certain combinatorial and topological properties they satisfy. We establish that they admit recognisable words at every level. As a consequence, we get that the subshifts…
Transitivity, the existence of periodic points and positive topological entropy can be used to characterize complexity in dynamical systems. It is known that for graphs that are not trees, for every $\varepsilon>0,$ there exist (complicate)…
Many branches of theoretical and applied mathematics require a quantifiable notion of complexity. One such circumstance is a topological dynamical system - which involves a continuous self-map on a metric space. There are many notions of…
We consider the semilinear elliptic boundary value problem \[ -\Delta u=\left\vert u\right\vert ^{p-2}u\text{ in }\Omega,\text{\quad }u=0\text{ on }\partial\Omega, \] in a bounded smooth domain $\Omega$ of $\mathbb{R}^{N}$ for supercritical…
In this manuscript we study properties of multidimensional shifts. More precisely, we study the necessary and sufficient conditions for a shift to be sofic, i.e. the boundary between sofic shifts and effective ones. To this end, we use…