中文
相关论文

相关论文: The Pentagonal Inequality

200 篇论文

Interpolation and approximation of functionals with conditionally positive definite kernels is considered on sets of centers that are not determining for polynomials. It is shown that polynomial consistency is sufficient in order to define…

数值分析 · 数学 2025-08-26 Oleg Davydov

In this paper we demonstrate how to partition the real number line into four subsets which may be reassembled, via "piecewise rigid functions" that preserve Lebesgue measure, into two copies of the line. We then employ a similar process to…

群论 · 数学 2015-11-05 Shelley Kandola , Sam Vandervelde

Given any two rational numbers $r_1$ and $r_2$, a necessary and sufficient condition is established for the three numbers $1$, $\cos (\pi r_1)$, and $\cos (\pi r_2)$ to be rationally independent. Extending a classical fact sometimes…

数论 · 数学 2015-04-28 Arno Berger

The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…

最优化与控制 · 数学 2011-12-08 Jesus A. De Loera , Peter N. Malkin , Pablo A. Parrilo

Approximating a definite integral of product of cosines to within an accuracy of n binary digits where the integrand depends on input integers x[k] given in binary radix, is equivalent to counting the number of equal-sum partitions of the…

数值分析 · 计算机科学 2016-01-06 Ohad Asor , Avishy Carmi

We study the quantitative relationship between the cones of nonnegative polynomials, cones of sums of squares and cones of sums of powers of linear forms. We derive bounds on the volumes (raised to the power reciprocal to the ambient…

代数几何 · 数学 2007-05-23 Grigoriy Blekherman

We use Gale duality for polynomial complete intersections and adapt the proof of the fewnomial bound for positive solutions to obtain the bound (e^4+3) 2^(k choose 2) n^k/4 for the number of non-zero real solutions to a system of n…

代数几何 · 数学 2007-10-04 Daniel J. Bates , Frédéric Bihan , Frank Sottile

We study the decomposition of multivariate polynomials as sums of powers of linear forms. As one of our main results we give an algorithm for the following problem: given a homogeneous polynomial of degree 3, decide whether it can be…

计算复杂性 · 计算机科学 2021-07-15 Pascal Koiran , Mateusz Skomra

This work presents a formalization of analogy on numbers that relies on generalized means. It is motivated by recent advances in artificial intelligence and applications of machine learning, where the notion of analogy is used to infer…

人工智能 · 计算机科学 2024-07-29 Yves Lepage , Miguel Couceiro

In this paper, we first propose a cohomological derivation of the celebrated Euler's Pentagonal Number Theorem. Then we prove an identity that corresponds to a bosonic extension of the theorem. The proof corresponds to a cohomological…

历史与综述 · 数学 2023-11-20 Masao Jinzenji , Yu Tajima

Quantile regression is a very important tool to explore the relationship between the response variable and its covariates. Motivated by mean regression with LASSO for compositional covariates proposed by Lin et al. (2014), we consider…

统计方法学 · 统计学 2020-06-02 Xuejun Ma , Ping Zhang

The linearization coefficients for a set of orthogonal polynomials are given explicitly as a weighted sum of combinatorial objects. Positivity theorems of Askey and Szwarc are corollaries of these expansions.

经典分析与常微分方程 · 数学 2008-02-03 Anne de Médicis , Dennis W. Stanton

Compared with constraint satisfaction problems, counting problems have received less attention. In this paper, we survey research works on the problems of counting the number of solutions to constraints. The constraints may take various…

人工智能 · 计算机科学 2020-12-29 Jian Zhang , Cunjing Ge , Feifei Ma

A method is proposed for defining an arbitrary number of differential calculi over a given noncommutative associative algebra. As an example the generalized quantum plane is studied. It is found that there is a strong correlation, but not a…

q-alg · 数学 2009-10-30 Aristophanes Dimakis , J. Madore

Using Barnes-Wall lattices and 1-cocycles on finite groups of monomial matrices, we give a procedure to construct tricosine spherical codes. This was inspired by a 14-dimensional code which Ballinger, Cohn, Giansiracusa and Morris…

组合数学 · 数学 2012-08-27 Robert L. Griess,

This report presents an elementary theory of unification for positive conjunctive queries. A positive conjunctive query is a formula constructed from propositional constants, equations and atoms using the conjunction $\wedge$ and the…

计算机科学中的逻辑 · 计算机科学 2022-07-19 Ján Komara

A new method of numerical solution for partial differential equations is proposed. The method is based on a fast matrix multiplication algorithm. Two-dimensional Poison equation is used for comparison of the proposed method with…

数值分析 · 数学 2016-06-02 Pavel Dourbal , Mikhail Pekker

How many ways can we write $n$ as a sum of $3$ positive integers, no pair of which share a common factor? We express this quantity in terms of the number of solutions to a certain class of linear Diophantine equations. This allows us to…

数论 · 数学 2020-02-03 James Thomas

Let $X$ be an algebraic variety over a finite field $\bF_q$, homogeneous under a linear algebraic group. We show that the number of rational points of $X$ over $\bF_{q^n}$ is a periodic polynomial function of $q^n$ with integer…

代数几何 · 数学 2009-04-17 Michel Brion , Emmanuel Peyre

Given an odd integer polynomial f(x) of a degree k >=3, we construct a non-negative valued, normed trigonometric polynomial with the spectrum in the set of integer values of f(x) not greater than n, and a small free coefficient…

数论 · 数学 2013-01-17 Marina Nincevic , Sinisa Slijepcevic