中文
相关论文

相关论文: Rational polynomials of simple type

200 篇论文

We lift to the multivariate Eulerian polynomials the identity implying that univariate Eulerian polynomials are palindromic. As a consequence of this generalization, we obtain nice combinatorial identities that can be directly extracted…

组合数学 · 数学 2026-01-23 Alejandro González Nevado

We give a formula and an estimation for the number of irreducible polynomials in two (or more) variables over a finite field.

交换代数 · 数学 2007-06-11 Arnaud Bodin

We show that the coefficients of rational 2-functions are contained in an abelian number field. More precisely, we show that the poles of such functions are poles of order one and given by roots of unity and rational residue.

数论 · 数学 2021-03-10 Felipe Müller

Real or complex polynomial mappings between affines spaces admitting a Lipschitz-trivial value are completely characterized.

代数几何 · 数学 2022-07-11 André Costa , Vincent Grandjean , Maria Michalska

This work is divided into three parts. The first part concerns polynomials in one variable with all real roots. We consider linear transformations that preserve real rootedness, as well as matrices that preserve interlacing. The second part…

经典分析与常微分方程 · 数学 2008-03-11 Steve Fisk

The naturally topologized order complex of proper algebraic subsets in $RP^2$, defined by systems of quadratic forms, has rational homology of $S^{13}$

代数拓扑 · 数学 2015-01-27 Victor A. Vassiliev

We study monic univariate polynomials whose coefficients are analytic functions of a real variable and whose roots lie in a specified analytic curve. These include characteristic polynomials of unitary and hermitian matrices whose entries…

代数几何 · 数学 2012-03-01 Wayne Lawton

In this paper we introduce and study motives for rational homotopy types.

代数几何 · 数学 2017-07-14 Isamu Iwanari

In this paper, a randomized algorithm for deciding the irreducibility of an irreducible polynomial and factoring a reducible polynomial over the field of rational numbers is presented. The main idea underlying the algorithm is based on…

综合数学 · 数学 2019-12-30 Duggirala Meher Krishna , Duggirala Ravi

Classes of simple polynomial and simple trigonometric splines given by Fourier series are considered. It is shown that the class of simple trigonometric splines includes the class of simple polynomial splines. For some parameter values, the…

数值分析 · 数学 2021-10-12 V. Denysiuk

In this paper we focus on two new families of polynomials which are connected with exponential polynomials and geometric polynomials. We discuss their generalizations and show that these new families of polynomials and their generalizations…

数论 · 数学 2010-02-03 Ayhan Dil , Veli Kurt

This is a straightforward introduction to the properties of polynomials in many variables that do not vanish in the open upper half plane. Such polynomials generalize many of the well-known properties of polynomials with all real roots.

经典分析与常微分方程 · 数学 2007-11-27 Steve Fisk

The language of probability is used to define several different types of conditional statements. There are four principal types: subjunctive, material, existential, and feasibility. Two further types of conditionals are defined using the…

逻辑 · 数学 2014-09-29 Joseph W. Norman

A unified theory of orthogonal polynomials of a discrete variable is presented through the eigenvalue problem of hermitian matrices of finite or infinite dimensions. It can be considered as a matrix version of exactly solvable Schr\"odinger…

经典分析与常微分方程 · 数学 2008-11-26 Satoru Odake , Ryu Sasaki

Probabilistic justification logic is a modal logic with two kind of modalities: probability measures and explicit justification terms. We present a tableau procedure that can be used to decide the satisfiability problem for this logic in…

计算机科学中的逻辑 · 计算机科学 2017-08-15 Ioannis Kokkinis

The p-adic valuation of a polynomial can be given by its valuation tree. This work describes the 2-adic valuation tree of the general degree 2 polynomial in 2 variables.

数论 · 数学 2024-12-24 Shubham

Here we study the typical rank for real bivariate homogeneous polynomials of degree $d\ge 6$ (the case $d\le 5$ being settled by P. Comon and G. Ottaviani). We prove that $d-1$ is a typical rank and that if $d$ is odd, then $(d+3)/2$ is a…

代数几何 · 数学 2012-04-17 Edoardo Ballico

We define a combinatorial object that can be associated with any conic-line arrangement with ordinary singularities, which we call the combinatorial Poincar\'e polynomial. We prove a Terao-type factorization statement on the splitting of…

代数几何 · 数学 2025-08-19 Piotr Pokora

We study rational homology groups of one-point compactifications of spaces of complex monic polynomials with multiple roots. These spaces are indexed by number partitions. A standard reformulation in terms of quotients of orbit arrangements…

组合数学 · 数学 2007-05-23 Dmitry N. Kozlov

Simple type theory is suited as framework for combining classical and non-classical logics. This claim is based on the observation that various prominent logics, including (quantified) multimodal logics and intuitionistic logics, can be…

计算机科学中的逻辑 · 计算机科学 2015-03-17 Christoph Benzmueller