中文
相关论文

相关论文: The Discrete Logarithm Problem in Bergman's non-re…

200 篇论文

The ideal membership problem asks whether an element in the ring belongs to the given ideal. In this paper, we propose a function that reflecting the complexity of the ideal membership problem in the ring of Laurent polynomials with integer…

群论 · 数学 2024-08-06 Wenhao Wang

We study the non-compact Sobolev embeddings into the optimal scale of Lorentz spaces, $W_0^mL^{p,q}(\Omega) \to L^{\frac{dp}{d - mp},r}(\Omega)$, where $\Omega \subseteq \mathbb{R}^d$, $1 \le m \le d$ and $0<q<r\le\infty$ with $1<p<\frac…

泛函分析 · 数学 2025-02-11 Chian Yeong Chuah , Jan Lang , Liding Yao

Let N and p be two prime numbers > 3 such that p divides N-1. We estimate the p-rank of the class group of Q(N^(1/p)) in terms of the discrete logarithm, with values un F_p, of certain units. Using the Gross--Koblitz formula and identities…

数论 · 数学 2018-04-04 Emmanuel Lecouturier

In \cite{MacResField} the second author gave a systematic analysis of definability and decidability for rings $\mathcal M/p\mathcal M$, where $\mathcal M$ is a model of Peano Arithmetic and $p$ is a prime in $\mathcal M$. In the present…

逻辑 · 数学 2021-02-02 P. D'Aquino , A. Macintyre

Discrete tomography is concerned with the reconstruction of images that are defined on a discrete set of lattice points from their projections in several directions. The range of values that can be assigned to each lattice point is…

组合数学 · 数学 2009-07-30 Arjen Stolk , K. Joost Batenburg

Orthogonal decomposition of the special linear Lie algebra over the complex numbers was studied in the early 1980s and attracted further attentions in the past decade due to its application in quantum information theory. In this paper, we…

环与代数 · 数学 2018-02-08 Songpon Sriwongsa , Yi Ming Zou

Let $g_n$, $n=1,2,\dots$, be the logarithmic derivative of a complex polynomial having all zeros on the unit circle, i.e., a function of the form $g_n(z)=(z-z_{1})^{-1}+\dots+(z-z_{n})^{-1}$, $|z_1|=\dots=|z_n|=1$. For any $p>0$, we…

经典分析与常微分方程 · 数学 2022-09-15 Mikhail A. Komarov

The supersingular Endomorphism Ring problem is the following: given a supersingular elliptic curve, compute all of its endomorphisms. The presumed hardness of this problem is foundational for isogeny-based cryptography. The One Endomorphism…

密码学与安全 · 计算机科学 2023-10-17 Aurel Page , Benjamin Wesolowski

Let cp(R) be the probability that two random elements of a finite ring R commute and zp(R) the probability that the product of two random elements in R is zero. We show that if cp(R)=e, then there exists a Lie-ideal D in the Lie-ring…

环与代数 · 数学 2023-07-25 Pavel Shumyatsky , Matteo Vannacci

The question of embedding fields into central simple algebras $B$ over a number field $K$ was the realm of class field theory. The subject of embedding orders contained in the ring of integers of maximal subfields $L$ of such an algebra…

数论 · 数学 2010-06-21 Benjamin Linowitz , Thomas R. Shemanske

We consider the ring of coinvariants for modular representations of cyclic groups of prime order. For all cases for which explicit generators for the ring of invariants are known, we give a reduced Gr\"obner basis for the Hilbert ideal and…

交换代数 · 数学 2007-05-23 Müfit Sezer , R. James Shank

The exact range of the positive real parameter $p$ is determined so that the multiplications by polynomial functions acting on Bergman spaces over complex ellipsoids are Schatten $p$-summable.

泛函分析 · 数学 2021-10-12 Mohammad Jabbari

In general the endomorphisms of a non-abelian group do not form a ring under the operations of addition and composition of functions. Several papers have dealt with the ring of functions defined on a group which are endomorphisms when…

环与代数 · 数学 2016-02-24 Gary Walls , Linhong Wang

This article presents a numerical illustration of a recently proposed strongly polynomial-time algorithm for the general linear programming (LP) problem. Each iteration of the proposed algorithm consists of two Gauss-Jordan pivoting…

最优化与控制 · 数学 2026-05-12 Samuel Awoniyi

It is shown that there exists a nontrivial uniform algebra that is Dirichlet on its maximal ideal space and has a dense set of elements that are exponentials. This answers a 65-year-old question of John Wermer and a 17-year-old question of…

复变函数 · 数学 2025-12-23 Alexander J. Izzo

The Transversal problem, i.e, the enumeration of all the minimal transversals of a hypergraph in output-polynomial time, i.e, in time polynomial in its size and the cumulated size of all its minimal transversals, is a fifty years old open…

数据结构与算法 · 计算机科学 2014-07-09 Mamadou Moustapha Kanté , Vincent Limouzy , Arnaud Mary , Lhouari Nourine , Takeaki Uno

In this paper we discuss the Hidden Subgroup Problem (HSP) in relation to post-quantum group-based cryptography. We review the relationship between HSP and other computational problems discuss an optimal solution method, and review the…

密码学与安全 · 计算机科学 2018-05-22 Kelsey Horan , Delaram Kahrobaei

Let $p$ be a sufficiently large prime number, $r$ be any given positive integer. Suppose that $a_1,\,\dots,\,a_r$ are pairwise distinct and not zero modulo $p$. Let $N(a_1,\,\dots,\,a_r;\,p)$ denote the number of…

数论 · 数学 2020-11-11 Chaohua Jia

The elliptic curve discrete logarithm problem is of fundamental importance in public-key cryptography. It is in use for a long time. Moreover, it is an interesting challenge in computational mathematics. Its solution is supposed to provide…

密码学与安全 · 计算机科学 2023-10-09 Ansari Abdullah , Ayan Mahalanobis

The hidden subgroup problem~(HSP) is one of the most important problems in quantum computation. Many problems for which quantum algorithm achieves exponential speedup over its classical counterparts can be reduced to the Abelian HSP.…

量子物理 · 物理学 2023-05-05 Hefeng Wang
‹ 上一页 1 8 9 10 下一页 ›