arXiv research

The hypercube's perimeter is significantly larger than expected near half volume.

In this paper we introduce a representation of a embedded knotted (sometimes Lagrangian) tori in $\BR^4$ called a hypercube diagram, i.e., a 4-dimensional cube diagram. We prove the existence of hypercube homology that is invariant under 4-dimensional cube diagram moves, a homology that is based on knot Floer homology.…

New Fourier analysis method for non-uniform Boolean hypercube.

Hypercube graphs are optimal in spectral rigidity due to Bakry--Émery curvature.

Paper improves variational inference on Boolean hypercube using quantum methods.

Simplified Khovanov polynomials for bipartite links.

Regular integer lattices are characterized by k unit vectors that build up their generator matrices. These have rank k for D-lattices, and are rank-deficient for A-lattices, for E_6 and E_7. We count lattice points inside hypercubes centered at the origin for all three types, as if classified by maximum infinity norm i…

The study shows how discrete graphs can resemble hypercube structures under certain curvature conditions.

We study a general online linear optimization problem(OLO). At each round, a subset of objects from a fixed universe of $n$ objects is chosen, and a linear cost associated with the chosen subset is incurred. To measure the performance of our algorithms, we use the notion of regret which is the difference between the to…

New algorithm learns halfspaces over hypercube with random bit flips.

We give rigidity results for the discrete Bonnet-Myers diameter bound and the Lichnerowicz eigenvalue estimate. Both inequalities are sharp if and only if the underlying graph is a hypercube. The proofs use well-known semigroup methods as well as new direct methods which translate curvature to combinatorial properties.…

In hypercube approach to correlation functions in Chern-Simons theory (knot polynomials) the central role is played by the numbers of cycles, in which the link diagram is decomposed under different resolutions. Certain functions of these numbers are further interpreted as dimensions of graded spaces, associated with hy…

The study finds a diameter bound for graphs with positive entropic Ricci curvature, with optimal bounds for arithmetic mean.

We consider the problem of estimating $\mathbb{E} [f(U^1, \ldots, U^d)]$, where $(U^1, \ldots, U^d)$ denotes a random vector with uniformly distributed marginals. In general, Latin hypercube sampling (LHS) is a powerful tool for solving this kind of high-dimensional numerical integration problem. In the case of depende…

We exhibit an explicit delooping of the space of string links with $m$ components in the hypercube $I^{n}$, for $n\geq 4$ and $m\geq 1$.

This paper considers a new family of variational distributions motivated by Sklar's theorem. This family is based on new copula-like densities on the hypercube with non-uniform marginals which can be sampled efficiently, i.e. with a complexity linear in the dimension of state space. Then, the proposed variational densi…

We give an algorithm for completing an order-$m$ symmetric low-rank tensor from its multilinear entries in time roughly proportional to the number of tensor entries. We apply our tensor completion algorithm to the problem of learning mixtures of product distributions over the hypercube, obtaining new algorithmic result…

A second part of detailed elementary introduction into Khovanov homologies. This part is devoted to reduced Jones superpolynomials. The story is still about a hypercube of resolutions of a link diagram. Each resolution is a collection of non-intersecting cycles, and one associates a 2-dimensional vector space with each…

This work extends score-based methods to binary data on the Boolean hypercube.

The Wythoff construction takes a $d$-dimensional polytope $P$, a subset $S$ of $\{0,..., d\}$ and returns another $d$-dimensional polytope $P(S)$. If $P$ is a regular polytope, then $P(S)$ is vertex-transitive. This construction builds a large part of the Archimedean polytopes and tilings in dimension 3 and 4. We want …

Unified algorithm for linear bandits with improved regret bound.

Stochastic partition models divide a multi-dimensional space into a number of rectangular regions, such that the data within each region exhibit certain types of homogeneity. Due to the nature of their partition strategy, existing partition models may create many unnecessary divisions in sparse regions when trying to d…

Polynomial-time algorithm finds planted hypercube vectors in Gaussian mixtures.

For any three-manifold presented as surgery on a framed link (L,Λ) in an integral homology sphere, Manolescu and Ozsváth construct a hypercube of chain complexes whose homology calculates the Heegaard Floer homology of Λ-framed surgery on Y. This carries a natural filtration that exists on any hypercube of chain comple…

A new sampling strategy improves reliability and robustness optimization for complex designs.

We prove the existence of a spectral sequence for Lagrangian Floer homology which converges to the Floer homology of the image of a Lagrangian submanifold under multiple fibred Dehn twists. The $E_1$ term of the sequence is given by the hypercube of "resolutions" of the Dehn twists involved. The proof relies on the exa…

We study the dynamics of co-evolution of producers and customers described by bit-strings representing individual traits. Individual ''size-like'' properties are controlled by binary encounters which outcome depends upon a recognition process. Depending upon the parameter set-up, mutual selection of producers and custo…

In this paper, we study the multi-asset Black-Scholes model in terms of the importance that the correlation parameter space (equivalent to an $N$ dimensional hypercube) has in the solution of the pricing problem. We show that inside of this hypercube there is a surface, called the Kummer surface $Σ_K$, where the determ…

We study the approximation of measurable functions on the hypercube by functions arising from affine neural networks. Our main achievement is an approximation of any measurable function $f \colon W_n \to [-1,1]$ up to a prescribed precision $\varepsilon>0$ by a bounded number of neurons, depending only on $\varepsilon$…

A new method separates data points using entropy minimization over a hypercube.

This paper upgrades instanton TQFT to infinity-categories for better simplification.

The uncertainty or the variability of the data may be treated by considering, rather than a single value for each data, the interval of values in which it may fall. This paper studies the derivation of basic description statistics for interval-valued datasets. We propose a geometrical approach in the determination of s…

Improves QMC for complex distributions using transport maps.

The paper analyzes reflected diffusion models on hypercube data.

We prove diameter bounds for graphs having positive Ricci-curvature bound in Bakry-Emery sense. One result using only curvature and maximal vertex degree is sharp in case of hypercubes. The other result depends on an additional dimension bound, but is independent of the vertex degree. In particular, the second result i…

The staircase property aids deep learning by guiding hierarchical feature learning.

We introduce a new discrete system that arises from ellipsoidal billiards and is closely related to the double reflection nets. The system is defined on the lattice of a uniform honeycomb consisting of rectified hypercubes and cross polytopes. In the $2$-dimensional case, the lattice is regular and it incorporates dyna…

We consider closed simplicial and cubical $n$-complexes in terms of link of their $(n-2)$-faces. Especially, we consider the case, when this link has size 3 or 4, i.e., every $(n-2)$-face is contained in 3 or 4 $n$-faces. Such simplicial complexes with {\em short} (i.e. of length 3 or 4) links are completely classified…

In this paper, we study fundamental problems of maximizing DR-submodular continuous functions that have real-world applications in the domain of machine learning, economics, operations research and communication systems. It captures a subclass of non-convex optimization that provides both theoretical and practical guar…

In this paper we show how to combinatorically compute the rotation class of a large family of embedded Legendrian tori in $\mathbb{R}^5$ with the standard contact form. In particular, we give a formula to compute the Maslov index for any loop on the torus and compute the Maslov number of the Legendrian torus. These for…

Wilson-loop averages in Chern-Simons theory (HOMFLY polynomials) can be evaluated in different ways -- the most difficult, but most interesting of them is the hypercube calculus, the only one applicable to virtual knots and used also for categorification (higher-dimensional extension) of the theory. We continue the stu…

This paper studies convergence properties of multivariate distributions constructed by endowing empirical margins with a copula. This setting includes Latin Hypercube Sampling with dependence, also known as the Iman--Conover method. The primary question addressed here is the convergence of the component sum, which is r…

In this article we study the Heegaard Floer link homology of $(n, n)$-torus links. The Alexander multigradings which support non-trivial homology form a string of $n-1$ unit hypercubes in $\mathbb{R}^{n}$, and we compute the ranks and gradings of the homology in nearly all Alexander gradings. We also conjecture a compl…

George Cybenko's landmark 1989 paper showed that there exists a feedforward neural network, with exactly one hidden layer (and a finite number of neurons), that can arbitrarily approximate a given continuous function $f$ on the unit hypercube. The paper did not address how to find the weight/parameters of such a networ…

Sampling strategies significantly affect feature approximations in ELA, impacting classifier accuracy.

Cannon, Floyd, and Parry have studied subdivisions of the 2-sphere extensively, especially those corresponding to 3-manifolds, in an attempt to prove Cannon's conjecture. There has been a recent interest in generalizing some of their tools, such as extremal length, to higher dimensions. We define finite subdivision rul…

The standard method of generating random weights and biases in feedforward neural networks with random hidden nodes, selects them both from the uniform distribution over the same fixed interval. In this work, we show the drawbacks of this approach and propose a new method of generating random parameters. This method en…

We introduce the notion of Bonnet-Myers and Lichnerowicz sharpness in the Ollivier Ricci curvature sense. Our main result is a classification of all self-centered Bonnet-Myers sharp graphs (hypercubes, cocktail party graphs, even-dimensional demi-cubes, Johnson graphs $J(2n,n)$, the Gosset graph and suitable Cartesian …