Results 31 to 40 of about 3,709,601 (369)
Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph [PDF]
Symposium on the Theory of Computing, 2016 In the Densest k-Subgraph (DkS) problem, given an undirected graph G and an integer k, the goal is to find a subgraph of G on k vertices that contains maximum number of edges.
Pasin Manurangsi
semanticscholar +1 more source
A Non-NP-Complete Algorithm for a Quasi-Fixed Polynomial Problem
Abstract and Applied Analysis, 2013 Let be a real-valued polynomial function of the form , with degree of in An irreducible real-valued polynomial function and a nonnegative integer are given to find a polynomial function satisfying the following expression: for some constant .
Yi-Chou Chen, Hang-Chin Lai
doaj +1 more source
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
Quadratic symmetric polynomials and an analogue of the Davenport constant
Acta Mathematica Hungarica, 2023 In this paper, we define the constant $D(φ, p)$, an analogue for the Davenport constant, for sequences on the finite field $\mathbb{F}_p$, defined via quadratic symmetric polynomials. Next, we state a series of results presenting either the exact value of $D(φ, p)$, or lower and upper bounds for this constant.
Godinho, H. +3 more
openaire +2 more sources
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
Estimates of the asymptotic Nikolskii constants for spherical polynomials [PDF]
Journal of Complexity, 2021 Let $Π_n^d$ denote the space of spherical polynomials of degree at most $n$ on the unit sphere $\mathbb{S}^d\subset \mathbb{R}^{d+1}$ that is equipped with the surface Lebesgue measure $dσ$ normalized by $\int_{\mathbb{S}^d} \, dσ(x)=1$. This paper establishes a close connection between the asymptotic Nikolskii constant, $$ \mathcal{L}^\ast(d):=\lim_{n\
Dai, Feng +2 more
openaire +3 more sources
Sharp values for the constants in the polynomial Bohnenblust-Hille inequality [PDF]
, 2015 In this paper we prove that the complex polynomial Bohnenblust-Hille constant for $2$-homogeneous polynomials in ${\mathbb C}^2$ is exactly $\sqrt[4]{\frac{3}{2}}$.
Jiménez-Rodríguez, P. +3 more
core +6 more sources
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
Polynomial-Time Tensor Decompositions with Sum-of-Squares [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2016 We give new algorithms based on the sum-of-squares method for tensor decomposition. Our results improve the best known running times from quasi-polynomial to polynomial for several problems, including decomposing random overcomplete 3-tensors and ...
Tengyu Ma, Jonathan Shi, David Steurer
semanticscholar +1 more source