中文
相关论文

相关论文: On the Generality of $1+\mathbf{i}$ as a Non-Norm …

200 篇论文

Quasi-polycyclic (QP for short) codes over a finite chain ring $R$ are a generalization of quasi-cyclic codes, and these codes can be viewed as an $R[x]$-submodule of $\mathcal{R}_m^{\ell}$, where $\mathcal{R}_m:= R[x]/\langle f\rangle$,…

信息论 · 计算机科学 2021-11-10 Rongsheng Wu , Minjia Shi , Patrick Solé

Define the minimal excludant of an overpartition $\pi$, denoted $ \overline{\text{mex}}(\pi)$, to be the smallest positive integer that is not a part of the non-overlined parts of $\pi$. For a positive integer $n$, the function…

数论 · 数学 2023-09-11 Victor Manuel R. Aricheta , Judy Ann L. Donato

For an $n \times n$ matrix $M$ with entries in $\mathbb{Z}_2$ denote by $R(M)$ the minimal rank of all the matrices obtained by changing some numbers on the main diagonal of $M$. We prove that for each non-negative integer $k$ there is a…

组合数学 · 数学 2021-04-22 Eugene Kogan

Several observed anomalies in neutrino oscillation data could be explained by a hypothetical fourth neutrino separated from the three standard neutrinos by a squared mass difference of a few 0.1 eV$^2$ or more. This hypothesis can be tested…

仪器与探测器 · 物理学 2015-06-11 Th. Lasserre

An element $\alpha \in \mathbb{F}_{q^n}$ is normal over $\mathbb{F}_q$ if $\mathcal{B}=\{\alpha, \alpha^q, \alpha^{q^2}, \cdots, \alpha^{q^{n-1}}\}$ forms a basis of $\mathbb{F}_{q^n}$ as a vector space over $\mathbb{F}_q$. It is well known…

数论 · 数学 2020-12-24 Victor G. L. Neumann , Josimar J. R. Aguirre

Let $q=2^n$ with $n=2m$ . Let $1\leq k\leq n-1$ and $k\neq m$. In this paper we determine the value distribution of following exponential sums \[\sum\limits_{x\in \bF_q}(-1)^{\Tra_1^m (\alpha x^{2^{m}+1})+\Tra_1^n(\beta…

信息论 · 计算机科学 2009-02-27 Jinquan Luo , Hongyu Wang , Yuansheng Tang

For a finite (not necessarily Abelian) group $(\Gamma,\cdot)$, let $n(\Gamma) \in \mathbb{N}$ denote the smallest positive integer $n$ such that for every labelling of the arcs of the complete digraph of order $n$ using elements from…

组合数学 · 数学 2024-07-16 Rutger Campbell , J. Pascal Gollin , Kevin Hendrey , Raphael Steiner

We investigate the problem of determining a set S of k indistinguishable integers in the range [1,n]. The algorithm is allowed to query an integer $q\in [1,n]$, and receive a response comparing this integer to an integer randomly chosen…

数据结构与算法 · 计算机科学 2013-02-06 Mark Braverman , Gal Oshri

An integer composition of a nonnegative integer $n$ is a tuple $(\pi_1,\ldots,\pi_k)$ of nonnegative integers whose sum is $n$; the $\pi_i$'s are called the parts of the composition. For fixed number $k$ of parts, the number of $f$-weighted…

组合数学 · 数学 2015-04-03 Steffen Eger

Let $q$ be a prime power and let $\mathcal{R}=\mathbb{F}_{q}[u_1,u_2, \cdots, u_k]/\langle f_i(u_i),u_iu_j-u_ju_i\rangle$ be a finite non-chain ring, where $f_i(u_i), 1\leq i \leq k$ are polynomials, not all linear, which split into…

信息论 · 计算机科学 2022-12-07 Swati Bhardwaj , Mokshi Goyal , Madhu Raka

A Sidon set is a set of integers containing no nontrivial solutions to the equation $a+b=c+d$. We improve on the lower bound on the diameter of a Sidon set with $k$ elements: if $k$ is sufficiently large and ${\cal A}$ is a Sidon set with…

数论 · 数学 2024-11-12 Kevin O'Bryant

It is shown why the discriminant of a maximal order within a cyclic division algebra must be minimized in order to get the densest possible matrix lattices with a prescribed nonvanishing minimum determinant. Using results from class field…

信息论 · 计算机科学 2009-08-19 C. Hollanti , J. Lahtonen , K. Ranto , R. Vehkalahti

Random number generators (RNG) based on quantum mechanics are captivating due to their security and unpredictability compared to conventional generators, such as pseudo-random number generators and hardware-random number generators. This…

We introduce the concept of boundariness capturing the most efficient way of expressing a given element of a convex set as a probability mixture of its boundary elements. In other words, this number measures (without the need of any…

量子物理 · 物理学 2014-09-01 Erkka Haapasalo , Michal Sedlak , Mario Ziman

In this article, we first describe all nonempty sets of integers S with the property that for all n and m in S, not necessarily distinct, the set {n-m,n+m} intersected with S consists of a single element. These are the sets with at most two…

群论 · 数学 2026-02-03 Artūras Dubickas , Chris Smyth

Be d_{m,n} a generic element in the infinite matrix D, with d_{1, n} defined as the n-th prime number and, for any m>1, d_{m, n} = | d_{m-1, n} - d_{m-1, n+1} | When n>1, after the first few terms the columns in the matrix appear to be…

数论 · 数学 2016-07-20 Raffaele Salvia

Our main result shows that for every odd natural number n > 1 there is a partition of the rational numbers, x/2n in lowest terms, in the unit interval, the product of whose Gamma values takes the form of powers of 2 and pi.

经典分析与常微分方程 · 数学 2009-07-13 Albert Nijenhuis

We consider a new multivariate generalization of the classical monic (univariate) Chebyshev polynomial that minimizes the uniform norm on the interval $[-1,1]$. Let $\Pi^*_n$ be the subset of polynomials of degree at most $n$ in $d$…

In this paper, we investigate the optimal nonadditive quantum error-detecting codes with distance two. The the numerical simulation shows that, with n being can be 5, 6, 7, 8, 10 and 12, such the n-qubit quantum error-detecting codes with…

量子物理 · 物理学 2009-01-13 Wen-Tai Yen , Li-Yi Hsu

We consider inhomogeneous square random matrices of size $N$ with independent entries of mean 0 and finite variance. We assume that the variance profile of this matrix is doubly stochastic and has a band-like structure with an appropriately…

概率论 · 数学 2025-08-27 Yi Han