English
Related papers

Related papers: On some counting problems for semi-linear sets

200 papers

A class of subharmonic functions represented by the modified kernels are proved to have the growth estimates $u(z)= o(y^{1-\alpha}|z|^{m+\alpha})$ at infinity in the upper half plane ${\bf C}_{+}$, which generalizes the growth properties of…

Functional Analysis · Mathematics 2008-11-14 Pan Guoshuang , Deng Guantie

Let $S_m f$ denote the $m$-th partial sum of the Walsh-Fourier series of $f \in L^1$. For an increasing sequence $a=(a(n))_{n \geq 1}$ of positive integers, consider the arithmetic means $$ \sigma_N f:=\frac{1}{N} \sum_{n=1}^N S_{a(n)} f .…

Classical Analysis and ODEs · Mathematics 2026-05-07 Ushangi Goginava

A set of functions is defined which is indexed by a positive integer $n$ and partitions of integers. The case $n=1$ reproduces the standard Schur polynomials. These functions are seen to arise naturally as a determinant of an action on the…

Algebraic Geometry · Mathematics 2007-05-23 Alex Kasman

Let ${\sf G}$ be a locally compact group with polynomial growth of order $d$, a polynomial weight $\nu$ on ${\sf G}$ and a Fell bundle $\mathscr C\overset{q}{\to}{\sf G}$. We study the Banach $^*$-algebras $L^1({\sf G}\,\vert\,\mathscr C)$…

Functional Analysis · Mathematics 2025-03-17 Felipe I. Flores

Let E_n={x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}}. If Matiyasevich's conjecture on finite-fold Diophantine representations is true, then for every computable function f:N->N there is a positive integer m(f) such that for…

Logic · Mathematics 2014-10-21 Apoloniusz Tyszka

In this work, we prove the existence of linear recurrences of order M with a non-trivial solution vanishing exactly on the set of gaps (or a subset) of a numerical semigroup S finitely generated by a1 < a2 <...< aN and M = aN. Keywords:…

Commutative Algebra · Mathematics 2013-11-01 Ivan Martino , Luca Martino

Let G be a torus acting linearly on a complex vector space M, and let X be the list of weights of G in M. We determine the equivariant K-theory of the open subset of M consisting of points with finite stabilizers. We identify it to the…

Differential Geometry · Mathematics 2008-08-20 Corrado De Concini , Claudio C. Procesi , Michele Vergne

We study semi-linear evolutionary problems where the linear part is the generator of a positive $C_0$-semigroup. The non-linear part is assumed to be quasi-increasing. Given an initial value in between a sub- and a super-solution of the…

Analysis of PDEs · Mathematics 2025-01-14 Wolfgang Arendt , Daniel Daners

This paper develops a deeper understanding of the structure and combinatorial significance of the partition function for Hermitian random matrices. The coefficients of the large N expansion of the logarithm of this partition function,also…

Mathematical Physics · Physics 2011-03-25 N. M. Ercolani

Let $N$ be a finitely generated nilpotent group. The subgroup zeta function $\zeta_N^{\leq}(s)$ and the normal zeta function $\zeta_N^\lhd(s)$ of $N$ are Dirichlet series enumerating the finite index subgroups or the finite index normal…

Group Theory · Mathematics 2022-10-13 Diego Sulca

In this paper we generalize the partial spread class and completely describe it for generalized Boolean functions from $\F_2^n$ to $\mathbb{Z}_{2^t}$. Explicitly, we describe gbent functions from $\F_2^n$ to $\mathbb{Z}_{2^t}$, which can be…

Information Theory · Computer Science 2015-11-06 Thor Martinsen , Wilfried Meidl , Pantelimon Stanica

An important question arising from the Frobenius Coin Problem is to decide whether or not a given monetary sum S can be obtained from N coin denominations. We develop a new Generating Function G(x), where the coefficient of x^i is equal to…

Discrete Mathematics · Computer Science 2010-01-08 Deepak Ponvel Chermakani

We prove that the growth rate of an endomorphism of a finitely generated nilpotent group equals to the growth rate of induced endomorphism on its abelinization, generalizing the corresponding result for an automorphism in [14]. We also…

Group Theory · Mathematics 2014-12-01 Alexander Fel'shtyn , Jang Hyun Jo , Jong Bum Lee

We show that the set of realizations of a given dimension of a max-plus linear sequence is a finite union of polyhedral sets, which can be computed from any realization of the sequence. This yields an (expensive) algorithm to solve the…

Data Structures and Algorithms · Computer Science 2011-03-14 Vincent Blondel , Stéphane Gaubert , Natacha Portier

Let A(n) be a $k\times s$ matrix and $m(n)$ be a $k$ dimensional vector, where all entries of A(n) and $m(n)$ are integer-valued polynomials in $n$. Suppose that $$t(m(n)|A(n))=#\{x\in\mathbb{Z}_{+}^{s}\mid A(n)x=m(n)\}$$ is finite for each…

Combinatorics · Mathematics 2007-10-02 Sheng Chen , Nan Li

Given an additively written abelian group $G$ and a set $X\subseteq G$, we let $\mathsf{D}(X)$ denote the Davenport constant of $X$, namely the largest non-negative integer $n$ for which there exists a sequence $x_1, \dots, x_n$ of elements…

Number Theory · Mathematics 2025-10-24 Benjamin Girard , Alain Plagne

Consider a system of $m$ balanced linear equations in $k$ variables with coefficients in $\mathbb{F}_q$. If $k \geq 2m + 1$, then a routine application of the slice rank method shows that there are constants $\beta,\gamma \geq 1$ with…

Combinatorics · Mathematics 2023-09-25 Josse van Dobben de Bruyn , Dion Gijswijt

Let G be a piecewise constant $n\times n$ matrix function which is defined on a smooth closed curve $\Gamma$ in the complex sphere and which has m jumps. We consider the problem of determining the partial indices of the factorization of the…

Classical Analysis and ODEs · Mathematics 2007-05-23 Torsten Ehrhardt , Ilya M. Spitkovsky

Let $\sum\_{n=0}^\infty a\_n z^n\in \overline{\mathbb Q}[[z]]$ be a $G$-function, and, for any $n\ge0$, let $\delta\_n\ge 1$ denote the least integer such that $\delta\_n a\_0, \delta\_n a\_1, ..., \delta\_n a\_n$ are all algebraic…

Number Theory · Mathematics 2016-06-03 S Fischler , T Rivoal

Let E_n={x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}}. There is an algorithm that for every computable function f:N->N returns a positive integer m(f), for which a second algorithm accepts on the input f and any integer…

Logic · Mathematics 2014-10-21 Apoloniusz Tyszka