Related papers: A new solution for the two dimensional dimer probl…
We propose a method for verifying that a given feasible point for a polynomial optimization problem is globally optimal. The approach relies on the Lasserre hierarchy and the result of Lasserre regarding the importance of the convexity of…
This work presents an efficient method for evaluation of wave scattering by doubly periodic diffraction gratings at or near "Wood anomaly frequencies". At these frequencies, one or more grazing Rayleigh waves exist, and the lattice sum for…
We present a simple criterion for solvability of lattice spin systems on the basis of the graph theory and the simplicial homology. The lattice systems satisfy algebras with graphical representations. It is shown that the null spaces of…
The overlap approach to chiral gauge theories on arbitrary $D$--dimensional lattices is studied. The doubling problem and its relation to chiral anomalies for $D=2$ and 4 is examined. In each case it is shown that the doublers can be…
This article is devoted to completing some aspects of the classical Cauchy-Lipschitz (or Picard-Lindel\"of) theory for general nonlinear systems posed on time scales, that are closed subsets of the set of real numbers. Partial results do…
The Half-Space Matching (HSM) method has recently been developed as a new method for the solution of 2D scattering problems with complex backgrounds, providing an alternative to Perfectly Matched Layers (PML) or other artificial boundary…
A rectangle blanket is a set of non-overlapping axis-aligned rectangles, used to approximately represent the two dimensional image of a shape approximately. The use of a rectangle blanket is a widely considered strategy for speeding-up the…
We initiate the study of the Diverse Pair of (Maximum/ Perfect) Matchings problems which given a graph $G$ and an integer $k$, ask whether $G$ has two (maximum/perfect) matchings whose symmetric difference is at least $k$. Diverse Pair of…
Dirac's theorem determines the sharp minimum degree threshold for graphs to contain perfect matchings and Hamiltonian cycles. There have been various attempts to generalize this theorem to hypergraphs with larger uniformity by considering…
The paper investigates the properties of certain biorthogonal polynomials appearing in a specific simultaneous Hermite-Pade' approximation scheme. Associated to any totally positive kernel and a pair of positive measures on the positive…
In this work, using a new geometrical approach we study to the existence of the fixed-point of mappings that independence of the smoothness, and also of their single-values or multi-values. This work proved the theorems that generalize in…
For Lax-pair isospectral deformations whose associated spectrum, for given initial data, consists of the disjoint union of a finitely denumerable discrete spectrum (solitons) and a continuous spectrum (continuum), the matrix Riemann-Hilbert…
We study perfect matchings, or close-packed dimer coverings, of finite sections of the eleven Archimedean lattices and give a constructive proof showing that any two perfect matchings can be transformed into each other using small sets of…
The dimer method is a Hessian-free algorithm for computing saddle points. We augment the method with a linesearch mechanism for automatic step size selection as well as preconditioning capabilities. We prove local linear convergence. A…
In this paper we derive a moment relaxation for large-scale nonsmooth optimization problems with graphical structure and spherical constraints. In contrast to classical moment relaxations for global polynomial optimization that suffer from…
By introducing a new point of view in Algebraic Topology relating elliptic curves in $\mathbb{R}^2$ and suitable bordism groups, the congruent number problem is solved showing that the Tunnell's theorem is also sufficient. This could be…
This study aims to construct a stable, high-order compact finite difference method for solving Sobolev-type equations with Dirichlet boundary conditions in one-space dimension. Approximation of higher-order mixed derivatives in some…
The Weber problem consists of finding a point in $\mathbbm{R}^n$ that minimizes the weighted sum of distances from $m$ points in $\mathbbm{R}^n$ that are not collinear. An application that motivated this problem is the optimal location of…
We study how the solution of the two-dimensional Dirichlet boundary problem for smooth simply connected domains depends upon variations of the data of the problem. We show that the Hadamard formula for the variation of the Dirichlet Green…
The problem of packing a system of particles as densely as possible is foundational in the field of discrete geometry and is a powerful model in the material and biological sciences. As packing problems retreat from the reach of solution by…