arXiv research

Transformed geometry into algebra to prove Pick's theorem efficiently.

This paper classifies hypersurfaces in n+1 with parallel Fubini-Pick form.

We show that the Cappell-Shaneson version of Pick's theorem for simple lattice polytopes is a consequence of a general relation between characteristic numbers of virtual submanifolds dual to the characteristic classes of a stably almost complex manifold. This relation is analogous to the miraculous cancellation formula…

We show that the volume entropy of the Hilbert metric on a closed convex projective surface tends to zero as the corresponding Pick differential tends to infinity. The proof is based on the theorem, due to Benoist and Hulin, that the Hilbert metric and Blaschke metric are comparable.

Classifies Calabi hypersurfaces with parallel Fubini-Pick form.

Paper proves a discrete Schwarz-Pick lemma for generalized circle packings.

A super-conformal map and a minimal surface are factored into a product of two maps by modeling the Euclidean four-space and the complex Euclidean plane on the set of all quaternions. One of these two maps is a holomorphic map or a meromorphic map. These conformal maps adopt properties of a holomorphic function or a me…

In this paper, a correspondence via duality is established between the set of locally strongly convex symmetric equiaffine hyperspheres and the set of minimal symmetric Lagrangian submanifolds in a certain complex space form. By using this correspondence theorem, we are able to provide an alternative proof of the class…

We study fibrations $\cV$ of toric varieties over the flag variety $G/T$, where $G$ is a compact semisimple Lie group and $T$ is a maximal torus. From symplectic data, we construct test configurations of $\cV$ and compute their Futaki invariants by employing a generalization of Pick's Theorem. We also give a simple for…

Study geometry of tetrahedra in complex hyperbolic space and Hilbert spaces.

We discuss the question of how to pick a matrix uniformly (in an appropriate sense) at random from groups big and small. We give algorithms in some cases, and indicate interesting problems in others.

The paper studies third-order PDEs invariant under affine transformations and connects them to the Fubini-Pick invariant.

The paper extends the Discrete Schwarz-Pick Lemma to circle packings with obtuse intersections and disjoint packings.

Optimal trend-following strategy uses simple EMA, avoiding complex cherry-picked signals.

Study finds cherry-picking load shaping strategies outperforms others in reducing grid CO2 emissions.

We introduce and study the equiaffine symmetric {\bf hyperspheres}. For the first step we consider the locally strongly convex ones. In fact, by the idea used by Naitoh, we provide in this paper a direct proof of the complete classification for those affine symmetric hyperspheres. Then, via an earlier result of the fir…

We present an intriguing question about lattice points in triangles where Pick's formula is "almost correct". The question has its origin in knot theory, but its statement is purely combinatorial. After more than 30 years the topological question was recently solved, but the lattice point problem is still open.

Cryo-electron microscopy (cryo-EM) studies using single particle reconstruction are extensively used to reveal structural information on macromolecular complexes. Aiming at the highest achievable resolution, state of the art electron microscopes automatically acquire thousands of high-quality micrographs. Particles are…

Particle picking is currently a critical step in the cryo-EM single particle reconstruction pipeline. Despite extensive work on this problem, for many data sets it is still challenging, especially for low SNR micrographs. We present the KLT (Karhunen Loeve Transform) picker, which is fully automatic and requires as an …

The Dirichlet random walk on manifolds has a positive escape rate if the cover is non-amenable.

In this note, we prove a Schwarz-Pick type lemma for minimal maps between negatively curved Riemannian surfaces. More precisely, we prove that if $f:M \to N$ is a minimal map with bounded Jacobian between two complete negatively curved Riemann surfaces M and N whose sectional curvatures $σ_M$ and $σ_N$ satisfy $infσ_M …

Sharp estimate on harmonic maps at conformal points in balls.

Motivated by the ideas and methods used by Naitoh in the consideration of parallel totally real submanifolds in complex space forms, the author of the present paper successfully makes use of the so called Jordan triple and (restricted) structure Lie algebra associated with a given Jordan algebra to establish a one-to-o…

Search-based methods for hard combinatorial optimization are often guided by heuristics. Tuning heuristics in various conditions and situations is often time-consuming. In this paper, we propose NeuRewriter that learns a policy to pick heuristics and rewrite the local components of the current solution to iteratively i…

If we pick $n$ random points uniformly in $[0,1]^d$ and connect each point to its $k-$nearest neighbors, then it is well known that there exists a giant connected component with high probability. We prove that in $[0,1]^d$ it suffices to connect every point to $c_{d,1} \log{\log{n}}$ points chosen randomly among its $…

Study analyzes 3,171 stocks to pick efficient portfolios using quantum and classical solvers.

Mass spectrometry (MS) is an important technique for chemical profiling which calculates for a sample a high dimensional histogram-like spectrum. A crucial step of MS data processing is the peak picking which selects peaks containing information about molecules with high concentrations which are of interest in an MS in…

New theorem guarantees approximate equilibrium in non-convex games.

No free lunch theorems suggest inductive biases are needed, but we show neural networks prefer low-complexity data.

Selection of appropriate collective variables for enhancing sampling of molecular simulations remains an unsolved problem in computational biophysics. In particular, picking initial collective variables (CVs) is particularly challenging in higher dimensions. Which atomic coordinates or transforms there of from a list o…

We consider the problem of evaluating the quality of startup companies. This can be quite challenging due to the rarity of successful startup companies and the complexity of factors which impact such success. In this work we collect data on tens of thousands of startup companies, their performance, the backgrounds of t…

We investigate whether a robot arm can learn to pick and throw arbitrary objects into selected boxes quickly and accurately. Throwing has the potential to increase the physical reachability and picking speed of a robot arm. However, precisely throwing arbitrary objects in unstructured settings presents many challenges:…

CAP algorithm controls FCR in online selective prediction.

We derive asset pricing formula for markets with incomplete information and subjective views.

In this article we present a method by which we can reduce a time series into a single point in $\mathbb{R}^{13}$. We have chosen 13 dimensions so as to prevent too many points from being labeled as "noise." When using a Euclidean (or Mahalanobis) metric, a simple clustering algorithm will with near certainty label the…

If an artificial intelligence aims to maximise risk-adjusted return, then under mild conditions it is disproportionately likely to pick an unethical strategy unless the objective function allows sufficiently for this risk. Even if the proportion $η$ of available unethical strategies is small, the probability ${p_U}$ of…

In this article, we advocate the ensemble approach for variable selection. We point out that the stochastic mechanism used to generate the variable-selection ensemble (VSE) must be picked with care. We construct a VSE using a stochastic stepwise algorithm, and compare its performance with numerous state-of-the-art algo…

A variety of methods have been proposed for interpreting nodes in deep neural networks, which typically involve scoring nodes at lower layers with respect to their effects on the output of higher-layer nodes (where lower and higher layers are closer to the input and output layers, respectively). However, we may be inte…

New method finds significant high-order interactions efficiently.

The paper solves circle packings on surfaces with boundaries.

This paper introduces a novel, well-founded, betweenness measure, called the Bag-of-Paths (BoP) betweenness, as well as its extension, the BoP group betweenness, to tackle semisupervised classification problems on weighted directed graphs. The objective of semi-supervised classification is to assign a label to unlabele…

Cryo-electron microscopy (cryoEM) is an increasingly popular method for protein structure determination. However, identifying a sufficient number of particles for analysis (often >100,000) can take months of manual effort. Current computational approaches are limited by high false positive rates and require significant…

The paper improves methods for estimating set size using samples.

We consider a two-person trading game in continuous time whereby each player chooses a constant rebalancing rule $b$ that he must adhere to over $[0,t]$. If $V_t(b)$ denotes the final wealth of the rebalancing rule $b$, then Player 1 (the `numerator player') picks $b$ so as to maximize $\mathbb{E}[V_t(b)/V_t(c)]$, whil…

We pick up the regime switching model for asset returns introduced by Rogers and Zhang. The calibration involves various markets including implied volatility in order to gain additional predictive power. We focus on the calculation of risk measures by Fourier methods that have successfully been applied to option pricin…

Deep neural networks (DNNs) have been widely used in the fields such as natural language processing, computer vision and image recognition. But several studies have been shown that deep neural networks can be easily fooled by artificial examples with some perturbations, which are widely known as adversarial examples. A…

We prove Poisson approximation results for the bottom part of the length spectrum of a random closed hyperbolic surface of large genus. Here, a random hyperbolic surface is a surface picked at random using the Weil-Petersson volume form on the corresponding moduli space. As an application of our result, we compute the …

In this paper, we study the properties of the Frank-Wolfe algorithm to solve the \ExactSparse reconstruction problem. We prove that when the dictionary is quasi-incoherent, at each iteration, the Frank-Wolfe algorithm picks up an atom indexed by the support. We also prove that when the dictionary is quasi-incoherent, t…