English
Related papers

Related papers: A note on monomials

200 papers

We prove a singular Darboux type theorem for homogeneous polynomial closed $2$-forms of degree one on $\mathbb{C}^n$. As application, we classify non-integrable codimension one distributions, of degree one, and arbitrary classes on…

Algebraic Geometry · Mathematics 2018-08-28 Maurício Corrêa , Vinícius Soares dos Reis

We prove a version of both Jacobi's and Montel's Theorems for the case of continuous functions defined over the field $\mathbb{Q}_p$ of $p$-adic numbers. In particular, we prove that, if \[ \Delta_{h_0}^{m+1}f(x)=0 \ \ \text{for all}…

Classical Analysis and ODEs · Mathematics 2013-02-19 J. M. Almira , Kh. F. Abu-Helaiel

We study one class of continuous functions $f$ defined on segment $[0,1]$ by equality $$ f(x)=\delta_{\alpha_1(x)1}+\sum^{\infty}_{k=2}\left[\delta_{\alpha_k(x)k}\prod^{k-1}_{j=1}g_{\alpha_j…

Classical Analysis and ODEs · Mathematics 2026-03-10 S. O. Klymchuk , M. V. Pratsiovytyi

We consider graph classes $\mathcal G$ in which every graph has components in a class $\mathcal{C}$ of connected graphs. We provide a framework for the asymptotic study of $\lvert\mathcal{G}_{n,N}\rvert$, the number of graphs in…

Combinatorics · Mathematics 2018-01-17 Konstantinos Panagiotou , Leon Ramzews

Suppose L is any finite algebraic extension of either the ordinary rational numbers or the p-adic rational numbers. Also let g_1,...,g_k be polynomials in n variables, with coefficients in L, such that the total number of monomial terms…

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

Let $H$ and $G$ be two finite graphs. Define $h_H(G)$ to be the number of homomorphisms from $H$ to $G$. The function $h_H(\cdot)$ extends in a natural way to a function from the set of symmetric matrices to $\mathbb{R}$ such that for…

Functional Analysis · Mathematics 2008-06-03 Hamed Hatami

Given a simple graph $G$ on $n$ vertices, a subset of vertices $U \subseteq V(G)$ is dominating if every vertex of $V(G)$ is either in $U$ or adjacent to a vertex of $U$. The domination polynomial of $G$ is the generating function whose…

Combinatorics · Mathematics 2021-10-05 Amanda Burcroff , Grace O'Brien

In this paper, we investigate the degree of $h$-polynomials of edge ideals of finite simple graphs. In particular, we provide combinatorial formulas for the degree of the $h$-polynomial for various fundamental classes of graphs such as…

Commutative Algebra · Mathematics 2024-08-26 Jennifer Biermann , Selvi Kara , Augustine O'Keefe , Joseph Skelton , Gabriel Sosa

We study the problem of counting the number of homomorphisms from an input graph $G$ to a fixed (quantum) graph $\bar{H}$ in any finite field of prime order $\mathbb{Z}_p$. The subproblem with graph $H$ was introduced by Faben and Jerrum…

Computational Complexity · Computer Science 2022-08-19 J. A. Gregor Lagodzinski , Andreas Göbel , Katrin Casel , Tobias Friedrich

We investigate the algebraic genericity of various families of continuous functions exhibiting extreme irregularity, focusing on fractal dimensions, H\"older regularity, and fractional differentiability. Our first main result shows that for…

Functional Analysis · Mathematics 2026-02-20 Céline Esser , Saeid Maghsoudi , Daniel L. Rodríguez-Vidanes , Juan. B. Seoane-Sepúlveda

In this paper, we will give suitable conditions on differential polynomials $Q(f)$ such that they take every finite non-zero value infinitely often, where $f$ is a meromorphic function in complex plane. These results are related to Problem…

Complex Variables · Mathematics 2020-03-20 Ta Thi Hoai An , Nguyen Viet Phuong

The classical Dirac theorem asserts that every graph $G$ on $n$ vertices with minimum degree $\delta(G) \ge \lceil n/2 \rceil$ is Hamiltonian. The lower bound of $\lceil n/2 \rceil$ on the minimum degree of a graph is tight. In this paper,…

Discrete Mathematics · Computer Science 2016-06-14 Yasemin Büyükçolak , Didem Gözüpek , Sibel Özkan , Mordechai Shalom

In this paper, we first consider the graph of $(F_1,F_{2},\cdots,F_{n})$ on $\overline{\mathbb{D}}^{n},$ where $F_{j}(z)=\bar{z}^{m_{j}}_{j}+R_{j}(z),j=1,2,\cdots,n,$ which has non-isolated CR-singularities if $m_{j}>1$ for some…

Complex Variables · Mathematics 2022-10-14 Golam Mostafa Mondal

We establish existence and uniqueness of solution for the homogeneous Dirichlet problem associated to a fairly general class of elliptic equations modeled by $$ -\Delta u= h(u){f} \ \ \text{in}\,\ \Omega, $$ where $f$ is an irregular datum,…

Analysis of PDEs · Mathematics 2019-07-23 Francescantonio Oliva , Francesco Petitta

Endowing the set of functional graphs (FGs) with the sum (disjoint union of graphs) and product (standard direct product on graphs) operations induces on FGs a structure of a commutative semiring R. The operations on R can be naturally…

Discrete Mathematics · Computer Science 2025-11-26 Alberto Dennunzio , Enrico Formenti , Luciano Margara , Sara Riva

We consider the problem of finding a homomorphism from an input digraph $G$ to a fixed digraph $H$. We show that if $H$ admits a weak-near-unanimity polymorphism $\phi$ then deciding whether $G$ admits a homomorphism to $H$ (HOM($H$)) is…

Computational Complexity · Computer Science 2020-08-11 Tomás Feder , Jeff Kinne , Ashwin Murali , Arash Rafiey

The domination polynomial D(G,x) of a graph G is the generating function of its dominating sets. We prove that D(G,x) satisfies a wide range of reduction formulas. We show linear recurrence relations for D(G,x) for arbitrary graphs and for…

Combinatorics · Mathematics 2013-04-26 Tomer Kotek , James Preen , Frank Simon , Peter Tittmann , Martin Trinks

We establish connectedness criteria for graphs associated to monomials in certain quotients of the mod 2 dual Steenrod algebra. We also investigate questions about trees and Hamilton cycles in the context of these graphs. Finally, we…

Algebraic Topology · Mathematics 2021-06-08 Donald M. Larson

We consider classical solutions to $-\Delta u = f(u)$ in half-spaces, under homogeneous Dirichlet boundary conditions. We prove that any positive solution is strictly monotone increasing in the direction orthogonal to the boundary, provided…

Analysis of PDEs · Mathematics 2025-10-03 Berardino Sciunzi , Domenico Vuono

Hindman's celebrated Finite Sums Theorem, and its high-dimensional version due to Milliken and Taylor, are extended from covers of countable sets to covers of arbitrary topological spaces with Menger's classic covering property. The methods…

General Topology · Mathematics 2017-11-09 Boaz Tsaban