Related papers: Finding twin smooth integers by solving Pell equat…
We construct the first smooth bubbling geometries using the Weyl formalism. The solutions are obtained from Einstein theory coupled to a two-form gauge field in six dimensions with two compact directions. We classify the charged Weyl…
The problem of Bayesian filtering and smoothing in nonlinear models with additive noise is an active area of research. Classical Taylor series as well as more recent sigma-point based methods are two well-known strategies to deal with these…
We analyze integer linear programs which we obtain after discretizing two-dimensional subproblems arising from a trust-region algorithm for mixed integer optimal control problems with total variation regularization. We discuss NP-hardness…
In a previous paper [11] we introduced a weighted binary average of two 2D point-normal pairs, termed circle average, and investigated subdivision schemes based on it. These schemes refine point-normal pairs in 2D, and converge to limit…
This paper develops an integer programming approach to two-sided many-to-one matching by investigating stable integral matchings of a fictitious market where each worker is divisible. We show that stable matchings exist in a discrete…
We explore the behavior of two-dimensional patchy colloidal particles with 8 or 10 symmetrically arranged patches by employing Monte-Carlo simulations. The particles interact according to an isotropic pair potential that possesses only one…
We solve a class of isoperimetric problems on $\mathbb{R}^2_+ :=\left\{ (x,y)\in \mathbb{R} ^2 : y>0 \right\}$ with respect to monomial weights. Let $\alpha $ and $\beta $ be real numbers such that $0\le \alpha <\beta+1$, $\beta\le 2…
We show that large gaps between smooth numbers are infrequent. The key new tool is a novel mean value bound for a special type of Dirichlet polynomial.
We study the problem of finding solutions to the stable matching problem that are robust to errors in the input and we obtain a polynomial time algorithm for a special class of errors. In the process, we also initiate work on a new…
Mixed integer sets have a strong modeling capacity to describe practical systems. Nevertheless, incorporating a mixed integer set often renders an optimization formulation drastically more challenging to compute. In this paper, we study how…
We study new identities related to the sums of adjacent terms in the Pell sequence, defined by $P_{n} := 2P_{n-1}+P_{n-2}$ for $ n\geq 2$ and $P_{0}=0, P_{1}=1$, and generalize these identities for many similar sequences. We prove that the…
In this work, a classical problem of the digital sequence design, or more precisely, finding binary sequences with optimal peak sidelobe level (PSL), is revisited. By combining some of our previous works, together with some mathematical…
A particular class of planar two-patch geometries, called bilinear-like $G^{2}$ two-patch geometries, is introduced. This class includes the subclass of all bilinear two-patch parameterizations and possesses similar connectivity functions…
In [Solving second order ordinary differential equations by extending the Prelle-Singer method, J. Phys. A: Math.Gen., 34, 3015-3024 (2001)] we defined a function (we called S) associated to a rational second order ordinary differential…
Label Smoothing (LS) is an effective regularizer to improve the generalization of state-of-the-art deep models. For each training sample the LS strategy smooths the one-hot encoded training signal by distributing its distribution mass over…
In this paper, we study the relations between the numerical structure of the optimal solutions of a convex programming problem defined on the edge set of a simple graph and the stability number (i.e. the maximum size of a subset of pairwise…
We exhibit a recurrence on the number of discrete line segments joining two integer points in the plane using an encoding of such segments as balanced words of given length and height over the two-letter alphabet $\{0,1\}$. We give…
Given an undirected graph and two disjoint vertex pairs $s_1,t_1$ and $s_2,t_2$, the Shortest two disjoint paths problem (S2DP) asks for the minimum total length of two vertex disjoint paths connecting $s_1$ with $t_1$, and $s_2$ with…
Byte-Pair Encoding (BPE) is a popular algorithm used for tokenizing data in NLP, despite being devised initially as a compression method. BPE appears to be a greedy algorithm at face value, but the underlying optimization problem that BPE…
We propose a new exact approach for solving integer linear programming (ILP) problems which we will call projective splitting algorithms (PSAs). Unlike classical methods for solving ILP problems, PSAs conduct the search for the optimal…