Related papers: Boundary complexity and surface entropy of 2-multi…
Kolmogorov complexity of a finite binary word reflects both algorithmic structure and the empirical distribution of symbols appearing in the word. Words with symbol frequencies far from one half have smaller combinatorial richness and…
We obtain the entropy and the surface entropy of the axial products on $\mathbb{N}^d$ and the $d$-tree $T^d$ of two types of systems: the subshift and the multiplicative subshift.
In this paper, we present a new approach of creating PTAS to the TSP problems by defining a bounded-curvature surface embedded spaces. Using this definition we prove: - A bounded-curvature surface embedded spaces TSP admits to a PTAS. -…
We develop a new theory for treating boundary problems for linear ordinary differential equations whose fundamental system may have a singularity at one of the two endpoints of the given interval. Our treatment follows an algebraic…
We prove the lower bound R(M_m) \geq 3/2 m^2 - 2 on the border rank of m x m matrix multiplication by exhibiting explicit representation theoretic (occurence) obstructions in the sense of the geometric complexity theory (GCT) program. While…
This article focuses on Lp-estimates for the square root of elliptic systems of second order in divergence form on a bounded domain. We treat complex bounded measurable coefficients and allow for mixed Dirichlet/Neumann boundary conditions…
This paper presents some finiteness results for the number of boundary slopes of immersed essential surfaces of given genus g in a compact 3-manifold with torus boundary. In the case of hyperbolic 3-manifolds we obtain uniform quadratic…
We investigate the parameterized complexity of Maximum Exposure Problem (MEP). Given a range space (R, P) where R is the set of ranges containing a set P of points, and an integer k, MEP asks for k ranges which on removal results in the…
We use the conformal invariance and the holographic correspondence to fully specify the dependence of entanglement entropy on the extrinsic geometry of the 2d surface $\Sigma$ that separates two subsystems of quantum strongly coupled…
A classical problem in dynamical systems is to measure the complexity of a map in terms of their orbits. One of the main tools we have to achieve this goal is entropy. However, many interesting families of dynamical systems have every…
Let $G$ be the group $\mathbb{Z}^d$ or the monoid $\mathbb{N}^d$ where $d$ is a positive integer. Let $X$ be a subshift over $G$, i.e., a closed and shift-invariant subset of $A^G$ where $A$ is a finite alphabet. We prove that the…
We consider in this paper the problem of computing the entropy of a braid. We recall its definition and construct, for each braid, a sequence of real numbers, whose limit is its entropy. We state one conjecture about the convergence speed,…
To test a possible relation between the topological entropy and the Arnold complexity, and to provide a non trivial example of a rational dynamical zeta function, we introduce a two-parameter family of two-dimensional discrete rational…
Given a countable set X (usually taken to be the natural numbers or integers), an infinite permutation, \pi, of X is a linear ordering of X. This paper investigates the combinatorial complexity of infinite permutations on the natural…
We consider the boundary value problem $-\Delta_p u = \lambda c(x) |u|^{p-2}u + \mu(x) |\grad u|^p + h(x)$, $u \in W^{1,p}_0(\Omega) \cap L^{\infty}(\Omega)$, where $\Omega \subset \mathbb R^N$, $N \geq 2$, is a bounded domain with smooth…
In this paper we continue the study started in part I (posted). We consider a planar, bounded, $m$-connected region $\Omega$, and let $\bord\Omega$ be its boundary. Let $\mathcal{T}$ be a cellular decomposition of $\Omega\cup\bord\Omega$,…
In this article, we compute the topological expansion of all possible mixed-traces in a hermitian two matrix model. In other words we give a recipe to compute the number of discrete surfaces of given genus, carrying an Ising model, and with…
The maximum graph bisection problem is a well known graph partition problem. The problem has been proven to be NP-hard. In the maximum graph bisection problem it is required that the set of vertices is divided into two partition with equal…
Recently, many geometric aspects of $\mathcal{N}$-extended AdS supergravity in chiral variables have been encountered and clarified. In particular, if the theory is supposed to be invariant under SUSY transformations also on boundaries, the…
We consider an arrangement $\A$ of $n$ hyperplanes in $\R^d$ and the zone $\Z$ in $\A$ of the boundary of an arbitrary convex set in $\R^d$ in such an arrangement. We show that, whereas the combinatorial complexity of $\Z$ is known only to…