English
Related papers

Related papers: A function field variant of Pillai's problem

200 papers

Given a faithful finite-dimensional representation $V$ of a finite group $G$ over any field $\mathbb{F}$, we show that any irreducible ${\mathbb{F}}G$-module $W$ appears, as a submodule or a quotient, in $\mathrm{Sym}^m(V)$ for some integer…

Representation Theory · Mathematics 2023-03-29 János Kollár , Pham Huu Tiep

The main goal of this paper is the study of two kinds of nonlinear problems depending on parameters in unbounded domains. Using a nonstandard variational approach, we first prove the existence of bounded solutions for nonlinear eigenvalue…

Analysis of PDEs · Mathematics 2016-04-04 Said El Manouni , Hichem Hajaiej , Patrick Winkert

For functions $f$ of a continuous variable in $\mathbb{R}^{+}$ we show that the Hirsch function $h_f$ equals $f$ iff $(f(f(x)) = x f(x))$ on $\mathbb{R}^{+}$, leading for continuous $f$ to $f$ = $\emptyset$ or the power function $f(x)$ =…

General Mathematics · Mathematics 2023-03-23 Leo Egghe

Let L be any number field or $\mathfrak{p}$-adic field and consider F:=(f_1,...,f_k) where f_i is in L[x_1,...,x_n]\{0} for all i and there are exactly m distinct exponent vectors appearing in f_1,...,f_k. We prove that F has no more than…

Number Theory · Mathematics 2007-05-23 J. Maurice Rojas

We investigate the existence, non-existence, uniqueness, and multiplicity of positive solutions to the following problem: \begin{align}\label{P} \left\{ \begin{array}{l} D_{0+}^\alpha u + h(t)f(u) = 0, \quad 0<t<1, \\[1ex] u(0)=u(1)=0,…

Analysis of PDEs · Mathematics 2026-01-21 Inbo Sim , Satoshi Tanaka

Consider a linear programming problem with n primal and m dual variables paired with n dual and m primal slack variables respectively, and aggregately denote these variables and slack variables as a vector z of length 2(n+m). Unlike…

Optimization and Control · Mathematics 2026-05-20 Wei Jing-Yuan

Let $p$ be an odd prime number. We prove that for $m\equiv1\mod p$, $x^m$ is perfectly nonlinear over $\mathbb{F}_{p^n}$ for infinitely many $n$ if and only if $m$ is of the form $p^l+1$, $l\in\mathbb{N}$. First, we study singularities of…

Number Theory · Mathematics 2012-05-04 Elodie Leducq

In this article we prove that equation $\phi(x)=n$, for a fixed $n$, admits a finite number of solutions, we find the general form of these solutions, and we show that: if $x_0$ is a unique solution of this equation then $x_0$ is a product…

General Mathematics · Mathematics 2007-05-23 Florentin Smarandache

We study existence and uniqueness of bounded solutions to a fractional sublinear elliptic equation with a variable coefficient, in the whole space. Existence is investigated in connection to a certain fractional linear equation, whereas the…

Analysis of PDEs · Mathematics 2013-11-15 Fabio Punzo , Gabriele Terrone

Let $\{u_{n}\}_{n \geq 0}$ be a non-degenerate binary recurrence sequence with positive discriminant. In this paper, we consider the Diophantine equation $u_m + u_n = a_1 n_1! + \cdots + a_k n_k!$ and prove that there are only finitely many…

Number Theory · Mathematics 2017-07-04 Sudhansu Sekhar Rout

Efficient algorithms for many problems in optimization and computational algebra often arise from casting them as systems of polynomial equations. Blum, Shub, and Smale formalized this as Hilbert's Nullstellensatz Problem $HN_R$: given…

Computational Complexity · Computer Science 2025-10-28 Markus Bläser , Sagnik Dutta , Gorav Jindal

The Fibonacci numbers satisfy the famous recurrence $F_n = F_{n - 1} + F_{n - 2}$. The theory of C-finite sequences ensures that the Fibonacci numbers whose indices are divisible by $m$, namely $F_{mn}$, satisfy a similar recurrence for…

Combinatorics · Mathematics 2022-07-01 Robert Dougherty-Bliss

This manuscript discusses planning problems for first- and second-order one-dimensional mean-field games (MFGs). These games are comprised of a Hamilton-Jacobi equation coupled with a Fokker-Planck equation. Applying Poincar\'e's Lemma to…

Analysis of PDEs · Mathematics 2021-04-27 Tigran Bakaryan , Rita Ferreira , Diogo Gomes

Let $F$ be a field of characteristic not $2$ with finitely many square classes. Using combinatorial arguments applied to objects related to vector spaces over finite fields, we deduce an upper bound for the number of Pfister forms over $F$.…

Number Theory · Mathematics 2024-05-03 Detlev Hoffmann , Nico Lorenz

Deciding the existence of an $l\times m\times n$ integer threeway table with given line-sums is NP-complete already for fixed $l=3$, but is in P with both $l,m$ fixed. Here we consider {\em huge} tables, where the variable dimension $n$ is…

Optimization and Control · Mathematics 2014-11-04 Shmuel Onn

In this short paper, we give an upper bound for the number of different basic feasible solutions generated by the simplex method for linear programming problems having optimal solutions. The bound is polynomial of the number of constraints,…

Optimization and Control · Mathematics 2015-03-17 Tomonari Kitahara , Shinji Mizuno

Let ${\mathbf{F}}_q$ be the finite field with $q=p^m$ elements and $G$ be a subgroup of ${\rm{GL}}_n({\mathbf{F}}_q)$. A famous theorem of Nori published in 1987 states that there exists a (non-effective) constant $c(n)$, depending only on…

Number Theory · Mathematics 2023-04-18 Davide Lombardo , Laura Paladino

We prove the existence of $N - 1$ distinct pairs of nontrivial solutions of the scalar field equation in ${\mathbb R}^N$ under a slow decay condition on the potential near infinity, without any symmetry assumptions. Our result gives more…

Analysis of PDEs · Mathematics 2013-12-23 Kanishka Perera

Let $V$ be a vector space over a finite field $k$. We give a condition on a subset $A \subset V$ that allows for a local criterion for checking when a function $f:A \to k$ is a restriction of a polynomial function of degree $<m$ on $V$. In…

Combinatorics · Mathematics 2018-12-05 David Kazhdan , Tamar Ziegler

In this article, we propose a new classification of $\Sigma^0_2$ formulas under the realizability interpretation of many-one reducibility (i.e., Levin reducibility). For example, ${\sf Fin}$, the decision of being eventually zero for…

Logic · Mathematics 2024-06-04 Takayuki Kihara