相关论文: Efficient congruencing in ellipsephic sets: the ge…

The main objective of this paper is to investigate the explicit form, stability character and global behavior of solutions of the following two systems of rational difference equations x_{n+1}=((+(-)1)/(y_{n}(x_{n-1}+(-)1)+1)),…

In this paper, we consider stochastic homogenization of elliptic equations with unbounded and non-uniformly elliptic coefficients. Extending subadditive arguments, we get an estimate for the rate of the convergence of the solution of the…

As explained in detail in the prologue to this manuscript, boundedness of weak solutions for general classes of elliptic equations in divergence form is a classic tool for achieving higher regularity. We propose here some global boundedness…

We use Reznick's Theorem for positive homogeneous polynomials to prove an elliptic regularity result for representations of enveloping algebras of Lie algebras. This allows us to relax a technical condition for a sum of squares…

In a common formulation of semi-infinite programs, the infinite constraint set is a requirement that a function parametrized by the decision variables is nonnegative over an interval. If this function is sufficiently closely approximable by…

In a previous paper {GN2} an effective solution of the lattice point counting problem in general domains in semisimple S-algebraic groups and affine symmetric varieties was established. The method relies on the mean ergodic theorem for the…

The Thue-Siegel method is applied to derive an upper bound for the number of solutions to Thue's equation $F(x,y) = 1$ where $F$ is a quartic diagonalizable form with negative discriminant. Computation is used in this argument to handle…

We prove the uniform boundedness of all solutions for a general class of Dirichlet anisotropic elliptic problems of the form $$-\Delta_{\overrightarrow{p}}u+\Phi_0(u,\nabla u)=\Psi(u,\nabla u) +f $$ on a bounded open subset $\Omega\subset…

In this paper, we present proofs of the coerciveness of first-order system least-squares methods for general (possibly indefinite) second-order linear elliptic PDEs under a minimal uniqueness assumption. For general linear second-order…

We propose an algorithm for solving bound-constrained mathematical programs with complementarity constraints on the variables. Each iteration of the algorithm involves solving a linear program with complementarity constraints in order to…

We consider the convex quadratic optimization problem with indicator variables and arbitrary constraints on the indicators. We show that a convex hull description of the associated mixed-integer set in an extended space with a quadratic…

For a large number of random constraint satisfaction problems, such as random k-SAT and random graph and hypergraph coloring, there are very good estimates of the largest constraint density for which solutions exist. Yet, all known…

LSQR, a Lanczos bidiagonalization based Krylov subspace iterative method, and its mathematically equivalent CGLS applied to normal equations system, are commonly used for large-scale discrete ill-posed problems. It is well known that LSQR…

We define sets of orthogonal polynomials satisfying the additional constraint of a vanishing average. These are of interest, for example, for the study of the Hohenberg-Kohn functional for electronic or nucleonic densities and for the study…

When $\mathbf h\in \mathbb Z^3$, denote by $B(X;\mathbf h)$ the number of integral solutions to the system \[ \sum_{i=1}^6(x_i^j-y_i^j)=h_j\quad (1\le j\le 3), \] with $1\le x_i,y_i\le X$ $(1\le i\le 6)$. When $h_1\ne 0$ and appropriate…

This paper presents two new augmented flexible (AF)-Krylov subspace methods, AF-GMRES and AF-LSQR, to compute solutions of large-scale linear discrete ill-posed problems that can be modeled as the sum of two independent random variables,…

This paper introduces a nonconforming virtual element method for general second-order elliptic problems with variable coefficients on domains with curved boundaries and curved internal interfaces. We prove arbitrary order optimal…

Computing the real solutions to a system of polynomial equations is a challenging problem, particularly verifying that all solutions have been computed. We describe an approach that combines numerical algebraic geometry and sums of squares…

We propose a proximal approach to deal with a class of convex variational problems involving nonlinear constraints. A large family of constraints, proven to be effective in the solution of inverse problems, can be expressed as the lower…

We propose a general method for optimization with semi-infinite constraints that involve a linear combination of functions, focusing on the case of the exponential function. Each function is lower and upper bounded on sub-intervals by…