Related papers: Boundary complexity and surface entropy of 2-multi…
We study boundary regularity at the infinity point $\boldsymbol{\infty}$ for nonlinear elliptic equations of $p$-Laplace type in unbounded open sets $\Omega \subset \mathbf{R}^n$. We consider the case $p \ge n \ge 2$ and characterize the…
The entropy of a quantum system is a measure of its randomness, and has applications in measuring quantum entanglement. We study the problem of measuring the von Neumann entropy, $S(\rho)$, and R\'enyi entropy, $S_\alpha(\rho)$ of an…
We propose an immersed boundary scheme for the numerical resolution of the Complete Electrode Model in Electrical Impedance Tomography, that we use as a main ingredient in the resolution of inverse problems in medical imaging. Such method…
In this paper, a new iterative two-level algorithm is presented for solving the finite element discretization for nonsymmetric or indefinite elliptic problems. The iterative two-level algorithm uses the same coarse space as the traditional…
This paper considers a finite sample perspective on the problem of identifying an LTI system from a finite set of possible systems using trajectory data. To this end, we use the maximum likelihood estimator to identify the true system and…
We study a bulk-surface coupled Laplace system involving an embedded open boundary. The problem is reformulated as an integro-differential equation using boundary integral representations, for which we establish existence and uniqueness of…
The occurrence of extremely thin concentration boundary layers at fluid interfaces for high local P\'eclet numbers is a severe obstacle for efficient and accurate numerical simulation of mass transfer processes in two-phase fluid systems.…
We prove that the problem of deciding whether a 2- or 3-dimensional simplicial complex embeds into $\mathbb{R}^3$ is NP-hard. Our construction also shows that deciding whether a 3-manifold with boundary tori admits an $\mathbb{S}^{3}$…
We consider the classic maximal and maximum independent set problems in three models of graph streams: In the edge-arrival model we see a stream of edges which collectively define a graph, this model has been well-studied for a variety of…
This paper is devoted to advancing the theoretical understanding of the iterated immediate snapshot (IIS) complexity of the Weak Symmetry Breaking task (WSB). Our rather unexpected main theorem states that there exist infinitely many values…
We consider the general problem of blocking all solutions of some given combinatorial problem with only few elements. For example, the problem of destroying all maximum cliques of a given graph by forbidding only few vertices. Problems of…
A set of integers is $S$-recognizable in an abstract numeration system $S$ if the language made up of the representations of its elements is accepted by a finite automaton. For abstract numeration systems built over bounded languages with…
In this manuscript we deal with regularity issues and the asymptotic behaviour (as $p \to \infty$) of solutions for elliptic free boundary problems of $p-$Laplacian type ($2 \leq p< \infty$): \begin{equation*} -\Delta_p u(x) +…
We apply the recently developped analytical methods for computing the boundary entropy, or the g-function, in integrable theories with non-diagonal scattering. We consider the particular case of the current-perturbed $SU(2)_k$ WZNW model…
A numerical code is described for constructing Doppler maps from the orbital variation of line profiles of (mass transfering) binaries. It uses an algorithm related to Richardson-Lucy iteration, and is much faster than the standard…
The first result of the present paper is to provide classes of explicit solutions for integrable boundary matrices for the multi-species ASEP with an arbitrary number of species. All the solutions we have obtained can be seen as…
This paper deals with the size complexity of minimal {\it two-way quantum finite automata} (2qfa's) necessary for operations to perform on all inputs of each fixed length. Such a complexity measure, known as state complexity of operations,…
We present exact results for two complementary measures of spatial structure generated by 1D spin systems with finite-range interactions. The first, excess entropy, measures the apparent spatial memory stored in configurations. The second,…
We provide a lower complexity bound for the satisfiability problem of a multi-agent justification logic, establishing that the general NEXP upper bound from our previous work is tight. We then use a simple modification of the corresponding…
The Thue-Morse set is the set of those nonnegative integers whose binary expansions have an even number of $1$. We obtain an exact formula for the state complexity of the multiplication by a constant of the Thue-Morse set $\mathcal{T}$ with…