English
Related papers

Related papers: RLWE and PLWE over cyclotomic fields are not equiv…

200 papers

We propose a general methodology for testing whether a given polynomial with integer coefficients is identically zero. The methodology evaluates the polynomial at efficiently computable approximations of suitable irrational points. In…

Data Structures and Algorithms · Computer Science 2007-05-23 Zhi-Zhong Chen , Ming-Yang Kao

Nonclassical symmetries and reductions of polynomial equations and systems of polynomial equations are considered. It is shown that specific polynomial equations having "hidden" symmetries can be reduced to classical symmetric systems of…

Numerical Analysis · Mathematics 2026-01-22 Inna K. Shingareva , Andrei D. Polyanin

We show that (as conjectured by Lin and Wang) when a Vassiliev invariant of type $m$ is evaluated on a knot projection having $n$ crossings, the result is bounded by a constant times $n^m$. Thus the well known analogy between Vassiliev…

q-alg · Mathematics 2008-02-03 Dror Bar-Natan

Recalling the similarities between the Maxwell equations for a transverse electric wave in a stratified medium and the quantum mechanical Schroedinger equation in a piece-wise potential, we investigate the analog of the so called particle…

Quantum Physics · Physics 2009-02-18 Stefano De Leo , Pietro Rotelli

Multiplicative noise widely exists in radar images, medical images and other important fields' images. Compared to normal noises, multiplicative noise has a generally stronger effect on the visual expression of images. Aiming at the…

Image and Video Processing · Electrical Eng. & Systems 2026-04-14 Xiao Siyao , Huang Libing , Zhang Shunsheng

Let $A\subseteq\{1,...,N\}$ and $P_1,...,P_\ell\in\Z[n]$ with $P_i(0)=0$ and $\deg P_i=k$ for every $1\leq i\leq\ell$. We show, using Fourier analytic techniques, that for every $\VE>0$, there necessarily exists $n\in\N$ such that…

Classical Analysis and ODEs · Mathematics 2014-02-26 Neil Lyall , Akos Magyar

In this paper we extend some results obtained by Artamonov and Sabitov for quantum polynomials to skew quantum polynomials and quasi-commutative bijective skew PBW extensions. Moreover, we find a counterexample to the conjecture proposed in…

Rings and Algebras · Mathematics 2014-07-29 Cristian Arturo Chaparro Acosta

We study the existence and non-existence of classical solutions for inequalities of type $$ \pm \Delta^m u \geq \big(\Psi(|x|)*u^p\big)u^q \quad\mbox{ in } {\mathbb R}^N (N\geq 1). $$ Here, $\Delta^m$ $(m\geq 1)$ is the polyharmonic…

Analysis of PDEs · Mathematics 2023-08-28 Marius Ghergu , Yasuhito Miyamoto , Vitaly Moroz

This paper introduces new notions of asymptotic proofs, PT(polynomial-time)-extensions, PTM(polynomial-time Turing machine)-omega-consistency, etc. on formal theories of arithmetic including PA (Peano Arithmetic). This paper shows that P…

Computational Complexity · Computer Science 2007-05-23 Tatsuaki Okamoto , Ryo Kashima

We provide theoretical and empirical evidence that using tighter evidence lower bounds (ELBOs) can be detrimental to the process of learning an inference network by reducing the signal-to-noise ratio of the gradient estimator. Our results…

Machine Learning · Statistics 2019-03-07 Tom Rainforth , Adam R. Kosiorek , Tuan Anh Le , Chris J. Maddison , Maximilian Igl , Frank Wood , Yee Whye Teh

Recently, Corvaja and Zannier obtained an extension of the Subspace Theorem with arbitrary homogeneous polynomials of arbitrary degreee instead of linear forms. Their result states that the set of solutions in P^n(K) (K number field) of the…

Number Theory · Mathematics 2023-09-19 Jan-Hendrik Evertse , Roberto G. Ferretti

Resolution refinements called w-resolution trees with lemmas (WRTL) and with input lemmas (WRTI) are introduced. Dag-like resolution is equivalent to both WRTL and WRTI when there is no regularity condition. For regular proofs, an…

Logic in Computer Science · Computer Science 2015-07-01 Samuel R. Buss , Jan Hoffmann , Jan Johannsen

Some versions of the electroweak SU(3)$_L\otimesU(1)_X$ models cannot be treated within perturbation theory at energies of few TeV. An extended version for these models is proposed which is perturbative even at TeV scale posing no…

High Energy Physics - Phenomenology · Physics 2009-11-10 Alex G. Dias

Polynomial approximations to boolean functions have led to many positive results in computer science. In particular, polynomial approximations to the sign function underly algorithms for agnostically learning halfspaces, as well as…

Computational Complexity · Computer Science 2014-12-09 Mark Bun , Thomas Steinke

We study three problems that involve identifying homogeneous halfspaces under Gaussian distributions: agnostic learning, one-sided reliable learning, and fairness auditing. In each of these problems, we are given labeled examples…

Machine Learning · Computer Science 2026-04-30 Jizhou Huang , Brendan Juba

In this paper, the problem of multiplicative anomaly of zeta regularization is solved for polynomials. For a regularizable sequence $\Lambda$, we explicitly calculate the zeta regularized product of $(\Lambda-z_1)\dots(\Lambda-z_n)$ for…

Number Theory · Mathematics 2025-09-04 Efe Gürel

In this paper, we introduce a novel variation of model-agnostic meta-learning, where an extra multiplicative parameter is introduced in the inner-loop adaptation. Our variation creates a shortcut in the parameter space for the inner-loop…

Machine Learning · Computer Science 2023-01-02 Chih-Jung Tracy Chang , Yuan Gao , Beicheng Lou

The equivalence of the covariant renormalization and the partial-wave renormaliz ation (PWR) approach is proven explicitly for the one-loop self-energy correction (SE) of a bound electron state in the presence of external perturbation…

High Energy Physics - Phenomenology · Physics 2009-10-31 I. Goidenko , G. Plunien , S. Zschocke , L. Labzowsky , G. Soff

In this work, we show, for the well-studied problem of learning parity under noise, where a learner tries to learn $x=(x_1,\ldots,x_n) \in \{0,1\}^n$ from a stream of random linear equations over $\mathrm{F}_2$ that are correct with…

Machine Learning · Computer Science 2021-07-07 Sumegha Garg , Pravesh K. Kothari , Pengda Liu , Ran Raz

It is shown that the $L^\alpha$-norms polynomials Rudin conjecture fails. Our counterexample is inspired by Bourgain's work on NLS. Precisely, his study of the Strichartz's inequality of the $L^6$-norm of the periodic solutions given by the…

Classical Analysis and ODEs · Mathematics 2021-10-13 el Houcein el Abdalaoui