中文
相关论文

相关论文: Waring's problem for rational functions in one var…

200 篇论文

When we study the Karnaugh map in the switching theory course, we learn that the ones in the map must be combined in groups of $a \times b$ elements, being $a$ and $b$ powers of two. The result is the logic function described as a sum of…

信号处理 · 电气工程与系统科学 2022-11-17 Mario Garrido

The main purpose of this paper is to give characterization theorems on derivations as well as on linear functions. Among others the following problem will be investigated: Let $n\in\mathbb{Z}$, $f, g\colon\mathbb{R}\to\mathbb{R}$ be…

经典分析与常微分方程 · 数学 2013-07-03 Eszter Gselmann

We prove a sharp density theorem for quadratic Waring's problem over cyclic groups, when the number of variables is at least $5$. Also, we obtain some new improvements on the density version of the quadratic Waring--Goldbach problem over…

数论 · 数学 2025-10-14 Zi Li Lim

Let $\mathbb{F}_q$ be the finite field of $q$ elements, for a given subset $D\subset \mathbb{F}_q$, $m\in \mathbb{N}$, an integer $k\leq |D|$ and $\boldsymbol{b}\in \mathbb{F}_q^m$ we are interested in determining the existence of a subset…

数论 · 数学 2024-01-17 Juan Francisco Gottig , Mariana Pérez , Melina Privitelli

Abduction is a fundamental and important form of non-monotonic reasoning. Given a knowledge base explaining how the world behaves it aims at finding an explanation for some observed manifestation. In this paper we focus on propositional…

计算复杂性 · 计算机科学 2010-06-29 Nadia Creignou , Johannes Schmidt , Michael Thomas

Cook's theorem is commonly expressed such as any polynomial time-verifiable problem can be reduced to the SAT problem. The proof of Cook's theorem consists in constructing a propositional formula A(w) to simulate a computation of TM, and…

计算复杂性 · 计算机科学 2019-05-01 Yu Li

A weighted automaton is functional if any two accepting runs on the same finite word have the same value. In this paper, we investigate functional weighted automata for four different measures: the sum, the mean, the discounted sum of…

形式语言与自动机理论 · 计算机科学 2017-01-11 Emmanuel Filiot , Raffaella Gentilini , Jean-François Raskin

Let $\sum a_nx^n\in\bar{\mathbb{Q}}[[x]]$ be the power series representation of a rational function and let $f:\ \{0,1,\ldots\}\rightarrow \bar{\mathbb{Q}}$ be a so-called almost quasi-polynomial. Under a necessary stability condition, we…

数论 · 数学 2023-07-18 Félix Baril Boudreau , Erik Holmes , Khoa D. Nguyen

We consider the amusing sequence of functions $f_n: \mathbb{R} \rightarrow \mathbb{R}$ given by $$ f_n(x) = \sum_{k=1}^{n}{\frac{|\sin{(k \pi x)}|}{k}}.$$ Every rational point is eventually the location of a strict local minimum of $f_n$:…

历史与综述 · 数学 2016-10-14 Stefan Steinerberger

In the literature two notions of the word problem for a variety occur. A variety has a decidable word problem if every finitely presented algebra in the variety has a decidable word problem. It has a uniformly decidable word problem if…

逻辑 · 数学 2016-09-06 Alan H. Mekler , Evelyn Nelson , Saharon Shelah

In the lambda calculus a term is solvable iff it is operationally relevant. Solvable terms are a superset of the terms that convert to a final result called normal form. Unsolvable terms are operationally irrelevant and can be equated…

计算机科学中的逻辑 · 计算机科学 2019-03-14 Á. García-Pérez , P. Nogueira

Waring problem for homogeneus forms asks for additive decomposition of a form $f$ into powers of linear forms. A classical problem is to determine when such a decomposition is unique. In this note I refine the work in arXiv:math/0406288v1…

代数几何 · 数学 2007-11-01 M. Mella

We present a restricted variable generalization of Warning's Second Theorem (a result giving a lower bound on the number of solutions of a low degree polynomial system over a finite field, assuming one solution exists). This is analogous to…

数论 · 数学 2014-05-12 Pete L. Clark , Aden Forrow , John R. Schmitt

We give an algorithm for computing all roots of polynomials over a univariate power series ring over an exact field $\mathbb{K}$. More precisely, given a precision $d$, and a polynomial $Q$ whose coefficients are power series in $x$, the…

符号计算 · 计算机科学 2017-05-31 Vincent Neiger , Johan Rosenkilde , Eric Schost

We find all non-rational meromorphic solutions of the equation $ww"-(w')^2=\alpha(z)w+\beta(z)w'+\gamma(z)$, where $\alpha$, $\beta$ and $\gamma$ are rational functions of $z$. In so doing we answer a question of Hayman by showing that all…

复变函数 · 数学 2014-11-10 Rod Halburd , Jun Wang

We produce an infinite family of transcendental numbers which, when raised to their own power, become rational. We extend the method, to investigate positive rational solutions to the equation $x^x = \alpha$, where $\alpha$ is a fixed…

数论 · 数学 2014-09-15 Sam Chow , Bin Wei

The classical decision problem, as it is understood today, is the quest for a delineation between the decidable and the undecidable parts of first-order logic based on elegant syntactic criteria. In this paper, we treat the concept of…

计算机科学中的逻辑 · 计算机科学 2019-11-27 Marco Voigt

We consider the variance of sums of arithmetic functions over random short intervals in the function field setting. Based on the analogy between factorizations of random elements of $\mathbb{F}_q[T]$ into primes and the factorizations of…

数论 · 数学 2018-08-08 Brad Rodgers

Let G be a finite quasisimple group of Lie type. We show that there are regular semisimple elements x,y in G, x of prime order, and |y| is divisible by at most two primes, such that the product of the conjugacy classes of x and y contain…

群论 · 数学 2015-03-23 Robert M. Guralnick , Pham Huu Tiep

This article presents a discussion of optimization problems where the objective function f(x) has parameters that are constrained by some scaling, so that q(x) = constant, where this function q() involves a sum of the parameters, their…

最优化与控制 · 数学 2025-01-07 John C. Nash , Ravi Varadhan