Results 21 to 30 of about 3,634,335 (213)
Comptes Rendus. Mathématique, 2021 We prove that the minimizer in the Nédélec polynomial space of some degree $p\ge 0$ of a discrete minimization problem performs as well as the continuous minimizer in $H({\bf curl})$, up to a constant that is independent of the polynomial degree $p$. The
Chaumont-Frelet, Théophile +2 more
doaj +1 more source
Bounds for sets with no polynomial progressions [PDF]
Forum of Mathematics, Pi, 2019 Let $P_1,\dots ,P_m\in \mathbb{Z} [y]$ be polynomials with distinct degrees, each having zero constant term. We show that any subset A of $\{1,\dots ,N\}$ with no nontrivial progressions of the form $x,x+P_1(y),\dots ,x+P_m(y)$ has size $|A|\ll N/(\log ...
Sarah Peluse
semanticscholar +1 more source
Meromorphic function sharing a small function with a linear differential polynomial [PDF]
Mathematica Bohemica, 2016 The problem of uniqueness of an entire or a meromorphic function when it shares a value or a small function with its derivative became popular among the researchers after the work of Rubel and Yang (1977).
Indrajit Lahiri, Amit Sarkar
doaj +1 more source
Problems on multivariate reliability polynomial
Atti della Accademia Peloritana dei Pericolanti : Classe di Scienze Fisiche, Matematiche e Naturali, 2017 The original results include: (i) homogenization of a reliability polynomial; (ii) compact hypersurfaces attached to homogeneous polynomials; (iii) an affine diffeomorphism that preserves a reliability polynomial; (iv) duality of networks via a ...
Constantin Udriste +2 more
doaj +1 more source
On the generalized Davenport constant and the Noether number [PDF]
, 2013 Known results on the generalized Davenport constant related to zero-sum sequences over a finite abelian group are extended to the generalized Noether number related to the rings of polynomial invariants of an arbitrary finite group.
A Geroldinger +19 more
core +1 more source
Secure Distributed Computing With Straggling Servers Using Polynomial Codes
IEEE Transactions on Information Forensics and Security, 2019 In this paper, we consider a secure distributed computing scenario in which a master wants to perform matrix multiplication of confidential inputs with multiple workers in parallel.
Heecheol Yang, Jungwoo Lee
semanticscholar +1 more source
Polynomiality for Bin Packing with a Constant Number of Item Types
, 2020 We consider the bin packing problem with d different item sizes s_i and item multiplicities a_i, where all numbers are given in binary encoding. This problem formulation is also known as the 1-dimensional cutting stock problem. In this work, we provide
Goemans, Michel X., Rothvoss, Thomas
core +1 more source
The polynomial method strikes back: tight quantum query bounds via dual polynomials [PDF]
Electron. Colloquium Comput. Complex., 2017 The approximate degree of a Boolean function f is the least degree of a real polynomial that approximates f pointwise to error at most 1/3. The approximate degree of f is known to be a lower bound on the quantum query complexity of f (Beals et al., FOCS ...
Mark Bun, Robin Kothari, J. Thaler
semanticscholar +1 more source
Nodal sets of Laplace eigenfunctions: polynomial upper estimates of the Hausdorff measure [PDF]
, 2016 Let $\mathbb{M}$ be a compact $C^\infty$-smooth Riemannian manifold of dimension $n$, $n\geq 3$, and let $\varphi_\lambda: \Delta_M \varphi_\lambda + \lambda \varphi_\lambda = 0$ denote the Laplace eigenfunction on $\mathbb{M}$ corresponding to the ...
A. Logunov
semanticscholar +1 more source
The Zhegalkin Polynomial of Multiseat Sole Sufficient Operator
Моделирование и анализ информационных систем, 2023 Among functionally complete sets of Boolean functions, sole sufficient operators are of particular interest. They have a wide range of applicability and are not limited to the two-seat case.
Leonid Y. Bystrov, Egor V. Kuzmin
doaj +1 more source