Výsledky vyhledávání - "Roswitha Rissner"

Split absolutely irreducible integer-valued polynomials over discrete valuation domains

Autor: Sophie Frisch, Sarah Nakato, Roswitha Rissner

Regarding non-unique factorization of integer-valued polynomials over a discrete valuation domain $(R,M)$ with finite residue field, it is known that there exist absolutely irreducible elements, that is, irreducible elements all of whose powers facto

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0316390312e8142842bcba8fea85c9cd

Zobrazit plný text záznamu

Absolute irreducibility of the binomial polynomials

Autor: Roswitha Rissner, Daniel Windisch

In this paper we investigate the factorization behaviour of the binomial polynomials $\binom{x}{n} = \frac{x(x-1)\cdots (x-n+1)}{n!}$ and their powers in the ring of integer-valued polynomials $\operatorname{Int}(\mathbb{Z})$. While it is well-known

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0a91bdddbbb65aed93862eac3605af6e

Zobrazit plný text záznamu

Bounds on the radius and status of graphs

Autor: Rainer E. Burkard, Roswitha Rissner

Publikováno v: Networks. 64:76-83

Two classical concepts of centrality in a graph are the median and the center. The connected notions of the status and the radius of a graph seem to be in no relation. In this paper, however, we show a clear connection of both concepts, as they obtai

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bc1ce1342e178be2c334798e35a0dce3
https://doi.org/10.1002/net.21558

Zobrazit plný text záznamu

Polynomially solvable special cases of the quadratic bottleneck assignment problem

Autor: Rainer E. Burkard, Roswitha Rissner

Publikováno v: Journal of Combinatorial Optimization. 22:845-856

Quadratic bottleneck assignment problems (QBAP) are obtained by replacing the addition of cost terms in the objective function of a quadratic (sum) assignment problem by taking their maximum. Since the QBAP is an $\mathcal{NP}$ -hard problem, polynim

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::93ffcaf7cfeb444b982860502e46bdd3
https://doi.org/10.1007/s10878-010-9333-7

Zobrazit plný text záznamu

Irreducible polynomials in Int(ℤ)

Autor: Roswitha Rissner, Sarah Nakato, Austin A. Antoniou

Publikováno v: ITM Web of Conferences, Vol 20, p 01004 (2018)

In order to fully understand the factorization behavior of the ring Int(ℤ) = {f ∈ ℚ[x] | f (ℤ) ⊆ ℤ} of integer-valued polynomials on ℤ, it is crucial to identify the irreducible elements. Peruginelli [8] gives an algorithmic criterion t

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::948a9fd76b56cfe5bcfaa69d8fffec60
https://doi.org/10.1051/itmconf/20182001004

Zobrazit plný text záznamu