\in \mathbb{N}$
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
Structure and Construction of Two-Dimensional Minimal Linear Codes over the rings $\mathbb{Z}_{p^n}$ with Applications to Secret Sharing
arXiv:2312.15954v3 Announce Type: replace Abstract: Minimal linear codes play an important role in coding theory and cryptography, particularly in the construction of secret sharing schemes. In this paper, we investigate the structure and construction of two-dimensional minimal linear codes over the finite rings $\mathbb{Z}_{p^n}$. We provide an explicit construction of a family of two-dimensional linear codes generated by a structured $2\times m$ matrix over $\mathbb{Z}_{p^n}$ and prove...
Almost covering all the layers of hypercube with multiplicities
Announce Type: replace-cross Abstract: Given a hypercube $\mathcal{Q}^{n} := \{0,1\}^{n}$ in $\mathbb{R}^{n}$ and $k \in \{0, \dots, n\}$, the $k$-th layer $\mathcal{Q}^{n}_{k}$ of $\mathcal{Q}^{n}$ denotes the set of all points in $\mathcal{Q}^{n}$ whose coordinates contain exactly $k$ many ones. For a fixed $t \in \mathbb{N}$ and $k \in \{0, \dots, n\}$, let $P \in \mathbb{R}\left[x_{1}, \dots, x_{n}\right]$ be a polynomial that has zeroes of multiplicity at least $t$ at all points of...
Infinite sequences with optimal diaphony, periodic $L_2$-discrepancy, and beyond
arXiv:2606.05482v1 Announce Type: new Abstract: We investigate the periodic $L_2$-discrepancy of infinite sequences $\S_d$ in $[0,1)^d$ and its analytic counterpart, the diaphony. We prove that infinite order-2 digital sequences over $\mathbb{F}_2$ attain the optimal order $L_{2,N}^{{\rm per}}(\S_d) \le C_d (\log N)^{d/2}/N$ for all $N \in \mathbb{N}\setminus \{1\}$, matching known lower bounds for infinitely many $N \in \mathbb{N}$.
Optimal Rates for Differentially Private Hypothesis Testing with E-values
Announce Type: replace Abstract: E-values have attracted considerable interest in recent years as flexible tools for enabling anytime-valid and adaptive data analysis. Hypothesis testing is at the core of many of these applications, which can often involve private or sensitive data. In this work, we answer a simple but important question: given two distributions $\mathbb{P}$ and $\mathbb{Q}$, what is the maximum achievable e-power when testing $X\sim \mathbb{P}^n$ against $X\sim\mathbb{Q}^n$...
Approximation by short exponential sums with geometric error decay based on Gauss quadrature
Announce Type: new Abstract: We present new short exponential sum approximations of length $N$ for $f_1(x)=\frac{1}{a+x}$ with $a>0$ on $[0, \infty)$ and for $f_2(x)= {\mathrm e}^{-x^2/2\sigma}$ with $\sigma>0$ on ${\mathbb R}$ with geometric error decay ${\rho}^{-2N}$ for user-defined $N \ge 2$ and $\rho > The approximations are built over consecutive intervals $[b_j, \, b_{j+1}) \subset [0, \infty)$, $j \in {\mathbb N}_{0}$, with interval lengths that depend on $\rho$ and grow...
Structures preserved by primitive actions of $S_\omega$
arXiv:2501.03789v4 Announce Type: replace-cross Abstract: We present a dichotomy for structures $A$ that are preserved by primitive actions of $S_{\omega} = \text{Sym}({\mathbb N})$: such a structure primitively positively constructs all finite structures and the constraint satisfaction problem is NP-complete, or the constraint satisfaction problem for $A$ is in P. To prove our result, we study the first-order reducts of the Johnson graph $J(k)$, for $k \geq 2$, whose automorphism group $G$...
Lean 4 Machine-Verified Proof of P = NP via the Pedigree Polytope Membership Problem
arXiv:2606.03194v1 Announce Type: new Abstract: The Membership Problem for Pedigree Polytope (M3P) asks, given $X\in\mathbb{Q}^{\binom{n}{3}}$, whether $X\in\mathrm{conv}(P_n)$, where $P_n$ is the set of all pedigrees. A pedigree is a structured encoding of a Hamiltonian cycle construction in $K_n$. We establish that M3P is solvable in strongly polynomial time via a recursively constructed layered network $(N_k, R_k, \mu)$ and a multicommodity flow problem MCF$(k)$. The necessary and...
A New Class of Linear Codes
arXiv:2401.07986v3 Announce Type: replace Abstract: Let $n$ be a prime power, $r$ be a prime with $r\mid n-1$, and $\varepsilon\in (0,1/2)$. Using the theory of multiplicative character sums and superelliptic curves, we construct new codes over $\mathbb F_r$ having length $n$, relative distance $(r-1)/r+O(n^{-\varepsilon})$ and rate $n^{-1/2-\varepsilon}$. When $r=2$, our binary codes have exponential size when compared to all previously known families of linear and non-linear codes with...
Collision Resistance of Single-Layer Neural Nets
arXiv:2606.03807v1 Announce Type: new Abstract: We initiate the study of the algorithmic complexity of finding collisions in single-layer binary neural networks. Given a random matrix $\mathbf{A} \in \mathbb{R}^{m\times n}$, an input $\mathbf{x} \in \{-1,1\}^n$ is mapped to a binary output vector $\varphi(\mathbf{A}\mathbf{x})\in \{-1,1\}^m$, where $\varphi$ is an activation function with constant behavior on $[\kappa, \infty)$ for some threshold $\kappa \geq 0$. We identify the threshold...
Revisiting the Bertrand Paradox via Equilibrium Analysis of No-regret Learners
Announce Type: replace Abstract: We study the discrete Bertrand pricing game with a non-increasing demand function. The game has $n \ge 2$ players who simultaneously choose prices from the set $\{1/k, 2/k, \ldots, 1\}$, where $k\in\mathbb{N}$. The player who sets the lowest price captures the entire demand; if multiple players tie for the lowest price, they split the demand equally. We study the Bertrand paradox, where classical theory predicts low prices, yet real markets often sustain high...