Related papers: Boundary complexity and surface entropy of 2-multi…
The purpose of this article is to study extrapolation of solvability for boundary value problems of elliptic systems in divergence form on the upper half-space assuming De Giorgi type conditions. We develop a method allowing to treat each…
We study the complexity of reasoning in abstracts argumentation frameworks close to graph classes that allow for efficient reasoning methods, i.e.\ to one of the classes of acyclic, noeven, biparite and symmetric AFs. In this work we show…
Error bounds and complexity bounds in numerical analysis and information-based complexity are often proved for functions that are defined on very simple domains, such as a cube, a torus, or a sphere. We study optimal error bounds for the…
In a bipartite graph, a subgraph is an $s$-biplex if each vertex of the subgraph is adjacent to all but at most $s$ vertices on the opposite set. The enumeration of $s$-biplexes from a given graph is a fundamental problem in bipartite graph…
We consider the entanglement entropy in critical one-dimensional quantum systems with open boundary conditions. We show that the second R\'enyi entropy of an interval away from the boundary can be computed exactly, provided the same…
We develop an embedded boundary method (EBM) to solve the two-phase incompressible flow with piecewise constant density. The front tracking method is used to track the interface. The fractional step methods are used to solve the…
A numerical method using implicit surface representations is proposed to solve the linearized Poisson-Boltzmann equations that arise in mathematical models for the electrostatics of molecules in solvent. The proposed method used an implicit…
The complexity of round robin method of intraprocedural data flow analysis is measured in number of iterations over the control flow graph. Existing complexity bounds realistically explain the complexity of only Bit-vector frameworks which…
Density-based topology optimization methods such as SIMP enable efficient topological exploration but produce diffuse material boundaries that require interpretation before manufacturing. Level-set methods maintain sharp interfaces but are…
An accelerated boundary integral method for Stokes flow of a suspension of deformable particles is presented for an arbitrary domain and implemented for the important case of a planar slit geometry. The computational complexity of the…
For an immersed minimal surface in $\mathbb{R}^3$, we show that there exists a lower bound on its Morse index that depends on the genus and number of ends, counting multiplicity. This improves, in several ways, an estimate we previously…
A method for computing the topological entropy of each braid in an infinite family, making use of Dynnikov's coordinates on the boundary of Teichm\"uller space, is described. The method is illustrated on two two-parameter families of…
The Joint Crossing Number problem asks for a simultaneous embedding of two disjoint graphs into one surface such that the number of edge crossings (between the two graphs) is minimized. It was introduced by Negami in 2001 in connection with…
We present a new methodology for the characterization of the metric entropy of infinite-dimensional ellipsoids with exponentially decaying semi-axes. This procedure does not rely on the explicit construction of coverings or packings and…
We realize constant-space quantum computation by measure-many two-way quantum finite automata and evaluate their language recognition power by analyzing patterns of their exotic behaviors and by exploring their structural properties. In…
By definition, a rigid graph in $\mathbb{R}^d$ (or on a sphere) has a finite number of embeddings up to rigid motions for a given set of edge length constraints. These embeddings are related to the real solutions of an algebraic system.…
We establish a sharp estimate for a minimal number of binary digits (bits) needed to represent all bounded total generalized variation functions taking values in a general totally bounded metric space $(E,\rho)$ up to an accuracy of…
Rice's Theorem states that every nontrivial language property of the recursively enumerable sets is undecidable. Borchert and Stephan initiated the search for complexity-theoretic analogs of Rice's Theorem. In particular, they proved that…
We present a general method for calculating R\'enyi entropies in the ground state of a one-dimensional critical system with mixed open boundaries, for an interval starting at one of its ends. In the conformal field theory framework, this…
In this paper, we study the existence of nontrivial solutions of the Dirichlet boundary value problem for the following elliptic system: \begin{equation} \left\{ \begin{aligned} -\Delta u & = au + bv + f(x,u,v); &\quad\mbox{ for…