Related papers: Conant's Metric Spectra Problem
In the total matching problem, one is given a graph $G$ with weights on the vertices and edges. The goal is to find a maximum weight set of vertices and edges that is the non-incident union of a stable set and a matching. We consider the…
Incorporating a non-Euclidean variable metric to first-order algorithms is known to bring enhancement. However, due to the lack of an optimal choice, such an enhancement appears significantly underestimated. In this work, we establish a…
Two widely-used computational paradigms for sublinear algorithms are using linear measurements to perform computations on a high dimensional input and using structured queries to access a massive input. Typically, algorithms in the former…
We propose to build a combinatorial invariant, called the spectral monodromy, from the spectrum of a single non-selfadjoint h-pseudodifferential operator with two degrees of freedom in the semi-classical limit. Our inspiration comes from…
This paper investigates several classical and novel variations of the Erd\H{o}s--Szekeres problem, including multicolored point sets, convex hexagons with a given number of interior points, and polygons with constraints on edge colors. We…
In this article we are introducing combinatorial spectra of graphs, this is a generalization of $H$-Hamiltonian spectra. The main motivation was to made from $H$-Hamiltonian spectra an operation and develop some algebra in this field. An…
We study how good a lexicographically maximal solution is in the weighted matching and matroid intersection problems. A solution is lexicographically maximal if it takes as many heaviest elements as possible, and subject to this, it takes…
For a degree 2n real d-dimensional multisequence \beta^(2n) to have a representing measure, it is necessary for the associated moment matrix M(n) to be positive semidefinite and for the algebraic variety V = V(\beta) associated to \beta to…
This paper is devoted to condition numbers of the multidimensional total least squares problem with linear equality constraint (TLSE). Based on the perturbation theory of invariant subspace, the TLSE problem is proved to be equivalent to a…
We describe an automated method for assigning the most probable physical parameters to the components of an eclipsing binary, using only its photometric light curve and combined colors. With traditional methods, one attempts to optimize a…
The tangent number $T_{2n+1}$ is equal to the number of increasing labelled complete binary trees with $2n+1$ vertices. This combinatorial interpretation immediately proves that $T_{2n+1}$ is divisible by $2^n$. However, a stronger…
Motivated by recent work on atomic norms in inverse problems, we propose a new approach to line spectral estimation that provides theoretical guarantees for the mean-squared-error (MSE) performance in the presence of noise and without…
Context: The technique of disentangling has been applied to numerous high-precision studies of spectroscopic binaries and multiple stars. Although, its possibilities have not yet been fully understood and exploited. Aims: Theoretical…
Let $\mathbb{Z}_n$ denote the ring of integers modulo $n$. In this paper we consider two extremal problems on permutations of $\mathbb{Z}_n$, namely, the maximum size of a collection of permutations such that the sum of any two distinct…
A method is described for solving relativistic quasi-potential equations in configuration space. The Blankenbecler-Sugar-Logunov-Tavkhelidze and an equal-time equation, both relativistic covariant two-body equations containing the full…
We show how in PT-symmetric 2J-level quantum systems the assumption of an upside-down symmetry (or duality) of their spectra simplifies their classification based on the non-equivalent pairwise mergers of the energy levels.
We demonstrate a new approach to classical fiber-fed spectroscopy. Our method is to use a photonic lantern that converts an arbitrary (e.g. incoherent) input beam into N diffraction-limited outputs. For the highest throughput, the number of…
Let $A$ be a matrix of size $n \times n$ over an algebraically closed field $F$ and $q(t)$ a monic polynomial of degree $n$. In this article, we describe the necessary and sufficient conditions of $q(t)$ so that there exists a rank one…
In this paper, we study the confounder detection problem in the linear model, where the target variable $Y$ is predicted using its $n$ potential causes $X_n=(x_1,...,x_n)^T$. Based on an assumption of rotation invariant generating process…
Brouwer's Conjecture states that, for any graph $G$, the sum of the $k$ largest (combinatorial) Laplacian eigenvalues of $G$ is at most $|E(G)| + \binom{k+1}{2}$, $1 \leq k \leq n$. We present several interrelated results establishing…