Related papers: Quasi-polynomial functions over bounded distributi…

We prove that continuous reducibility is a well-quasi-order on the class of continuous functions between separable metrizable spaces with analytic zero-dimensional domain. To achieve this, we define scattered functions, which generalize…

In this paper, we introduce the concept of residuated implications derived from quasi-overlap functions on lattices and prove some related properties. In addition, we formalized the residuation principle for the case of quasi-overlap…

The representations of dimension vector $\alpha$ of the quiver Q can be parametrised by a vector space $R(Q,\alpha)$ on which an algebraic group $\Gl(\alpha)$ acts so that the set of orbits is bijective with the set of isomorphism classes…

We consider Hilbert-type functions associated with difference (not necessarily inversive) field extensions and systems of algebraic difference equations in the case when the translations are assigned some integer weights. We will show that…

Consider the representations of an algebraic group G. In general, polynomial invariant functions may fail to separate orbits. The invariant subring may not be finitely generated, or the number and complexity of the generators may grow…

Let $R$ be a domain and $B=R[x_1^{\pm1},\ldots,x_n^{\pm1}]$ the Laurent polynomial ring over $R$. In this paper we study pre-factorially closed (pfc) and quasi-factorially closed (qfc) $R$-subalgebras of $B$, which generalize the notion of…

Stanley's theory of $(P,\omega)$-partitions is a standard tool in combinatorics. It can be extended to allow for the presence of a restriction, that is a given maximal value for partitions at each vertex of the poset, as was shown by Assaf…

Planar functions are mappings from a finite field $\mathbb{F}_q$ to itself with an extremal differential property. Such functions give rise to finite projective planes and other combinatorial objects. There is a subtle difference between…

The vector partition function $p_A$ associated to a $d \times n$ matrix $A$ with integer entries is the function $\mathbb{Z}^d \to \mathbb{N}$ defined by $\mathbf{b} \to \#\{\mathbf{x} \in \mathbb{N}^n : A\mathbf{x} = \mathbf{b}\}$. It is…

We investigate partial functions and computability theory from within a constructive, univalent type theory. The focus is on placing computability into a larger mathematical context, rather than on a complete development of computability…

A class of real functions, which is the generalization of a family of convex functions, is introduced; in this connection, we have defined $X$-convex, strictly $X$-convex, quasi-$X$-convex, strictly quasi-$X$-convex, and semi-strictly…

Let $f(x_1,...,x_k)$ be a polynomial over a field $K$. This paper considers such questions as the enumeration of the number of nonzero coefficients of $f$ or of the number of coefficients equal to $\alpha\in K^*$. For instance, if $K=\ff_q$…

In this paper we consider polynomial representability of functions defined over $Z_{p^n}$, where $p$ is a prime and $n$ is a positive integer. Our aim is to provide an algorithmic characterization that (i) answers the decision problem: to…

We introduce a concept of a quasi proximate order which is a generalization of a proximate order and allows us to study efficiently analytic functions whose order and lower order of growth are different. We prove an existence theorem of a…

To every subspace arrangement X we will associate symmetric functions P[X] and H[X]. These symmetric functions encode the Hilbert series and the minimal projective resolution of the product ideal associated to the subspace arrangement. They…

Let X be an affine real algebraic set . We investigate on the theory of algebraically constructible functions on X and the description of the semi-algebraic subsets of X when we replace the polynomial functions on X by some rational…

Polynomial functions on the group of units Q_n of the ring Z_{2^n} are considered. A finite set of reduced polynomials RP_n in Z[x] that induces the polynomial functions on Q_n is determined. Each polynomial function on Q_n is induced by a…

In his work on P-partitions, Stembridge defined the algebra of peak functions Pi, which is both a subalgebra and a retraction of the algebra of quasi-symmetric functions. We show that Pi is closed under coproduct, and therefore a Hopf…

An equivariant characteristic quasi-polynomial is a quasi-polynomial in $q$ consisting of the permutation character on the mod $q$ complement of the corresponding Coxeter arrangement. This concept is a refinement of the conventional…

We examine combinatorial counting functions with two parameters, $n$ and $q$. For fixed $q$, these functions are (quasi-)polynomial in $n$. As $q$ varies, the degree of this polynomial is itself polynomial in $q$, as are the leading…