2,906 results for poly · 0.179s

arxiv.org/abs/2512.21891v1

Non-polynomial divided difference and blossoming

Two notable examples of dual functionals in approximation theory and computer-aided geometric design are the blossom and the divided difference operator. Both of these dual functionals satisfy a similar set of formulas and identities. Moreover, the d...

arxiv.org/abs/math/9702220v1

Prehomogeneous vector spaces and ergodic theory III

Let H_1=SL(5), H_2=SL(3), H=H_1 \times H_2. It is known that (G,V) is a prehomogeneous vector space (see [22], [26], [25], for the definition of prehomogeneous vector spaces). A non-constant polynomial δ(x) on V is called a relative invariant poly...

Sponsored Partners
en.wikipedia.org/wiki/Cuckquean

Cuckquean - Wikipedia

Crime of passion Concubinage Erotic humiliation Male dominance (BDSM) Netorare Open marriage Polyamory Polygyny Swinging Coleman, Julie (1 January 1999)

en.wikipedia.org/wiki/Cuckold

Cuckold - Wikipedia

promiscuity Feminization (activity) Human sperm competition Monogamish Netorare Non-paternity event Open marriage Paternity fraud Polyamory Polyandry,

arxiv.org/abs/2311.08792v1

Matroids in OSCAR

OSCAR is an innovative new computer algebra system which combines and extends the power of its four cornerstone systems - GAP (group theory), Singular (algebra and algebraic geometry), Polymake (polyhedral geometry), and Antic (number theory). Here,...

arxiv.org/abs/2208.09186v1

Perturbations of polynomials and applications

After reconsidering the theorem of continuity of the roots of a polynomial in terms of its coefficients in the deformation framework, we study the stability of the greater common divisor of two polynomials compared to perturbations on their roots. We...

github.com/d3/d3-contour

d3/d3-contour

Compute contour polygons using marching squares. (⭐ 516)

arxiv.org/abs/1501.00665v1

Huge Unimodular N-Fold Programs

Optimization over $l\times m\times n$ integer $3$-way tables with given line-sums is NP-hard already for fixed $l=3$, but is polynomial time solvable with both $l,m$ fixed. In the {\em huge} version of the problem, the variable dimension $n$ is encod...

arxiv.org/abs/1910.10571v2

Faster p-norm minimizing flows, via smoothed q-norm problems

We present faster high-accuracy algorithms for computing $\ell_p$-norm minimizing flows. On a graph with $m$ edges, our algorithm can compute a $(1+1/\text{poly}(m))$-approximate unweighted $\ell_p$-norm minimizing flow with $pm^{1+\frac{1}{p-1}+o(1)...

www.reddit.com/r/Polytrix/comments/1px6lz8/guys_were_on_the_list_rumi_said_in_horror/

“…Guys we’re on the list.” Rumi said in horror.

“Oh, what list?” Zoey walked up with Mira. “There’s the nice list, the naughty list, the top ten Kpop groups list-“ “Wait, how do the naughty and nice list come before that one?” Mira a...

arxiv.org/abs/math/0202193v2

Invariant operators on supermanifolds and Standard Models

Here we continue to list the differential operators invariant with respect to the 15 exceptional simple Lie superalgebras of polynomial vector fields. A part of the list (for operators acting on tensors with finite dimensional fibers) was earlier o...

arxiv.org/abs/1411.0095v1

Provable Submodular Minimization using Wolfe's Algorithm

Owing to several applications in large scale learning and vision problems, fast submodular function minimization (SFM) has become a critical problem. Theoretically, unconstrained SFM can be performed in polynomial time [IFF 2001, IO 2009]. However, t...

arxiv.org/abs/1805.03451v1

Non-polyhedral extensions of the Frank-and-Wolfe theorem

In 1956 Marguerite Frank and Paul Wolfe proved that a quadratic function which is bounded below on a polyhedron $P$ attains its infimum on $P$. In this work we search for larger classes of sets $F$ with this Frank-and-Wolfe property. We establish the...