Searcharxiv⌕ Search

arXiv subjects

Hengyi Luo

Publications and source records attributed to Hengyi Luo.

4 recordsLinked to original sources

$\mathsf{SVP}_\infty$ Is NP-Hard for Power-of-two Cyclotomic Ideals

We prove that exact decision-$\mathsf{SVP}$ in the coefficient $\ell_\infty$-norm is $\mathsf{NP}$-complete for principal ideals and free modules of rank two over the cyclotomic rings $R_n=\mathbb{Z}[X]/(X^n+1)$, where $n$ ranges over powers of two. For each case, we give a deterministic polynomial-time many-one reduction from the Subset Sum problem. For an instance with $s$ positive input integers, the output lattice has dimension $O(s)$. A solution to the original Subset Sum instance can be recovered in polynomial time from any nonzero output lattice vector of norm at most the specified bound. We also transfer these reductions from $R_n$ to the power-of-two cyclic rings $S_{2n}=\mathbb{Z}[X]/(X^{2n}-1)$. This gives $\mathsf{NP}$-completeness of decision-$\mathsf{SVP}$ in the coefficient $\ell_\infty$-norm for principal ideals and free modules of any fixed positive rank over these rings.

cs.CC↗

A Complete Proof for Tu-Deng Conjecture

Let $N=2^k-1$ and let $\operatorname{wt}(n)$ denote the binary Hamming weight. The Tu-Deng conjecture asserts that, for every $1\le t\le N-1$, at most $2^{k-1}$ pairs $(a,b)\in\{0,\ldots,N-1\}^2$ satisfy $a+b\equiv t\pmod N$ and $\operatorname{wt}(a)+\operatorname{wt}(b)<k$. Partial results are known. We give a complete proof of this conjecture. We first show that the Tu-Deng counts equals the number of cyclic carry solutions for which $\operatorname{wt}(B)-\operatorname{wt}(A)<0$ and $A+t\equiv B\pmod N$. The enumerator of the cyclic carry solutions factors as $$C_v = 1+(X+Y-1)J_v+X^{\operatorname{z}(v)+1}Y^{\operatorname{o}(v)+1},$$ where $t=10v$ is the binary expansion of $t$(least significant bits first) and $J_v$ enumerates the language $$\operatorname{Sub}(v)\mathbin{\dot\cup}\{u\in\partial_1\operatorname{Sub}(v):u<_{\rm lex}v\}.$$ Estimating the strict negative half-plane mass of $C_v$ gives the desired bound.

math.CO↗

Deep Feature Embedding for Tabular Data

Tabular data learning has extensive applications in deep learning but its existing embedding techniques are limited in numerical and categorical features such as the inability to capture complex relationships and engineering. This paper proposes a novel deep embedding framework with leverages lightweight deep neural networks to generate effective feature embeddings for tabular data in machine learning research. For numerical features, a two-step feature expansion and deep transformation technique is used to capture copious semantic information. For categorical features, a unique identification vector for each entity is referred by a compact lookup table with a parameterized deep embedding function to uniform the embedding size dimensions, and transformed into a embedding vector using deep neural network. Experiments are conducted on real-world datasets for performance evaluation.

cs.LG↗

$λ$-TD algebras, generalized shuffle products and left counital Hopf algebras

The theory of operated algebras has played a pivotal role in mathematics and physics. In this paper, we introduce a $λ$-TD algebra that appropriately includes both the Rota-Baxter algebra and the TD-algebra. The explicit construction of free commutative $λ$-TD algebra on a commutative algebra is obtained by generalized shuffle products, called $λ$-TD shuffle products. We then show that the free commutative $λ$-TD algebra possesses a left counital bialgera structure by means of a suitable 1-cocycle condition. Furthermore, the classical result that every connected filtered bialgebra is a Hopf algebra, is extended to the context of left counital bialgebras. Given this result, we finally prove that the left counital bialgebra on the free commutative $λ$-TD algebra is connected and filtered, and thus is a left counital Hopf algebra.

math.RA↗