Related papers: Direct and Inverse Problems for Restricted Signed …

We deal with existence, uniqueness and regularity of nonnegative solutions to a Dirichlet problem for equations as \begin{equation*} \displaystyle -\operatorname{div}\left(\frac{|\nabla u|^{p-2}\nabla u}{(1+u)^{\theta(p-1)}}\right) = h(u)f…

We consider the supercritical problem {equation*} -\Delta u=|u| ^{p-2}u\text{\in}\Omega,\quad u=0\text{\on}\partial\Omega, {equation*} where $\Omega$ is a bounded smooth domain in $\mathbb{R}^{N}$ and $p$ smaller than the critical exponent…

Let $G$ be any group and $A$ be an arbitrary subset of $G$ (not necessarily symmetric and not necessarily containing the identity). The $h$-fold product set of $A$ is defined as $$A^{h} :=\lbrace a_{1}.a_{2}...a_{h} : a_{1},\ldots,a_n \in A…

For any fixed measure $H$ that maps graphs to real numbers, the MinH problem is defined as follows: given a graph $G$, an integer $k$, and a target $\tau$, is there a set $S$ of $k$ vertices that can be deleted, so that $H(G - S)$ is at…

We present a new way to encode weighted sums into unweighted pairwise constraints, obtaining the following results. - Define the k-SUM problem to be: given n integers in [-n^2k, n^2k] are there k which sum to zero? (It is well known that…

The subalgebra membership problem is the problem of deciding if a given element belongs to an algebra given by a set of generators. This is one of the best established computational problems in algebra. We consider a variant of this…

In this work, we construct numerical solutions to an inverse problem of a nonlinear Helmholtz equation defined in a spherical shell between two concentric spheres centered at the origin.Assuming that the values of the forward problem are…

Let A be a subset of the real line. We study the fractal dimensions of the k-fold iterated sumsets kA, defined as kA = A+...+A (k times). We show that for any non-decreasing sequence {a_k} taking values in [0,1], there exists a compact set…

We prove new results on the additive theory of reversed primes $\overleftarrow{p}$; that is, primes $p$ which are written backwards in a fixed base $b\geq 2$. In particular, we study a variant of Goldbach's conjecture, looking at…

In this paper we introduce a technique to determine the sumset $A+A$, where $A$ is the indicator function of the 0's occurring in a fixed point $x$ of a substitution on the alphabet $\{0,1\}$.

In this paper, we solve the prescribed Hermitian-Yang-Mills tensor problem for Higgs bundles over compact complex manifolds. Let $ (E,\theta) $ be a Higgs bundle over a compact Hermitian manifold $(M,\omega_g) $. Suppose that there exists a…

In this paper, we solve the prescribed Hermitian-Yang-Mills tensor problem. Let $ E $ be a holomorphic vector bundle over a compact K\"ahler manifold $(M,\omega_g) $. Suppose that there exists a smooth Hermitian metric $ h_0 $ on $E$ such…

Given an integer array A, the prefix-sum problem is to answer sum(i) queries that return the sum of the elements in A[0..i], knowing that the integers in A can be changed. It is a classic problem in data structure design with a wide range…

Infinite series of the type Sum{n=1,infinity}(alpha/2)_n_2F_1(-n, b; gamma; y)/(n n!) are investigated. Closed-form sums are obtained for alpha a positive integer alpha=1,2,3, ... The limiting case of b --> infinity, after y is replaced…

A subset $S$ of the Boolean hypercube $\mathbb{F}_2^n$ is a sumset if $S = \{a + b : a, b\in A\}$ for some $A \subseteq \mathbb{F}_2^n$. Sumsets are central objects of study in additive combinatorics, featuring in several influential…

By making use of arithmetic information inequalities, we give a strong quantitative bound for the discretised ring theorem. In particular, we show that if $A \subset [1,2]$ is a $(\delta,\sigma)$-set, with $|A| = \delta^{-\sigma},$ then…

Let $G$ be a finite abelian group, written additively, and $H$ a subgroup of~$G$. The \emph{subgroup sum graph} $\Gamma_{G,H}$ is the graph with vertex set $G$, in which two distinct vertices $x$ and $y$ are joined if $x+y\in…

Subset sum is a very old and fundamental problem in theoretical computer science. In this problem, $n$ items with weights $w_1, w_2, w_3, \ldots, w_n$ are given as input and the goal is to find out if there is a subset of them whose weights…

Let $A$ be a multiset with elements in an abelian group. Let $FS(A)$ be the multiset containing the $2^{|A|}$ sums of all subsets of $A$. We study the reconstruction problem ``Given $FS(A)$, is it possible to identify $A$?'', and we give a…

Let $G$ be a finite group. Let $\sigma =\{\sigma_{i} | i\in I\}$ be a partition of the set of all primes $\Bbb{P}$ and $n$ an integer. We write $\sigma (n) =\{\sigma_{i} |\sigma_{i}\cap \pi (n)\ne \emptyset \}$, $\sigma (G) =\sigma (|G|)$.…