Related papers: Boundary complexity and surface entropy of 2-multi…
Max Independent Set (MIS) is a paradigmatic problem in theoretical computer science and numerous studies tackle its resolution by exact algorithms with non-trivial worst-case complexity. The best such complexity is, to our knowledge, the…
We show $L^p$ estimates for square roots of second order complex elliptic systems $L$ in divergence form on open sets in $\mathbb{R}^d$ subject to mixed boundary conditions. The underlying set is supposed to be locally uniform near the…
We consider the problem of finding lower bounds on the I/O complexity of arbitrary computations in a two level memory hierarchy. Executions of complex computations can be formalized as an evaluation order over the underlying computation…
We establish basic information about border rank algorithms for the matrix multiplication tensor and other tensors with symmetry. We prove that border rank algorithms for tensors with symmetry (such as matrix multiplication and the…
We systematically explore the construction of Nielsen's circuit complexity to a non-Lorentzian field theory keeping in mind its connection with flat holography. We consider a 2d boundary field theory dual to 3d asymptotically flat…
Determining the asymptotic algebraic complexity of matrix multiplication, succinctly represented by the matrix multiplication exponent $\omega$, is a central problem in algebraic complexity theory. The best upper bounds on $\omega$, leading…
Kayal, Saha and Tavenas [Theory of Computing, 2018] showed that for all large enough integers $n$ and $d$ such that $d\geq \omega(\log{n})$, any syntactic depth four circuit of bounded individual degree $\delta = o(d)$ that computes the…
We study the complexity of S-adic sequences corresponding to a family of 216 multi-dimensional continued fractions maps, called Triangle Partition maps (TRIP maps), with an emphasis on those with low upper bounds on complexity. Our main…
We study the difficulty of computing topological entropy of subshifts subjected to mixing restrictions. This problem is well-studied for multidimensional subshifts of finite type : there exists a threshold in the irreducibility rate where…
Border basis detection (BBD) is described as follows: given a set of generators of an ideal, decide whether that set of generators is a border basis of the ideal with respect to some order ideal. The motivation for this problem comes from a…
We consider shift spaces in which elements of the alphabet may overlap nontransitively. We define a notion of entropy for such spaces, give several techniques for computing lower bounds for it, and show that it is equal to a limit of…
In this paper, we introduce a novel way to represent the interface for two-phase flows with phase change. We combine a level-set method with a Cartesian embedded boundary method and take advantage of both. This is part of an effort to…
In this paper, we take an in-depth look at the complexity of a hitherto unexplored Multiobjective Spanner (MSp) problem. The MSp is a multiobjective generalization of the well-studied Minimum t-Spanner problem. This multiobjective approach…
We outline a general algorithm for verifying whether a subset of the integers is a more sum than differences (MSTD) set, also known as sum dominated sets, and give estimates on its computational complexity. We conclude with some numerical…
The computational cost of the boundary-condition-enforced immersed boundary method (IBM) increases in the order of $\mathcal{O}(N^2)$ as the number of Lagrangian points, $N$, increases. This is due to the time-consuming calculation of the…
We consider the \emph{two-dimensional range maximum query (2D-RMQ)} problem: given an array $A$ of ordered values, to pre-process it so that we can find the position of the smallest element in the sub-matrix defined by a (user-specified)…
We study the dynamics of piecewise affine surface homeomorphisms from the point of view of their entropy. Under the assumption of positive topological entropy, we establish the existence of finitely many ergodic and invariant probability…
The tilings of lozenges in 2 dimensions and of rhomboedra in 3 dimensions are studied when they are constrained by fixed boundary conditions. We establish a link between those conditions and free or periodic boundary ones: the entropy is…
In recent studies, new measures of complexity for nonlinear systems have been proposed based on probabilistic grounds, as the LMC measure (Phys. Lett. A {\bf 209} (1995) 321) or the SDL measure (Phys. Rev. E {\bf 59} (1999) 2). All these…
The edge of a quantum critical system can exhibit multiple distinct types of boundary criticality. We use a numerical real-space renormalization group (RSRG) to study the boundary criticality of a 2d quantum Ising model with random exchange…