Related papers: q-Partitioning Valuations: Exploring the Space Bet…
We introduce two frameworks in order to deal with fractal and multi-fractal analysis for subset sum problems where some embedding into the $1$-dimensional Euclidean space plays an important role. As one of these frameworks, the notion of…
We provide a framework for relating certain q-series defined by sums over partitions to multiple zeta values. In particular, we introduce a space of polynomial functions on partitions for which the associated q-series are q-analogues of…
Many practical reinforcement learning environments have a discrete factored action space that induces a large combinatorial set of actions, thereby posing significant challenges. Existing approaches leverage the regular structure of the…
Fractionalization is a phenomenon where an elementary excitation partitions into several pieces. This picture explains non-trivial transport through a junction of one-dimensional edge channels defined by topologically distinct quantum Hall…
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…
Previous work in hierarchical reinforcement learning has faced a dilemma: either ignore the values of different possible exit states from a subroutine, thereby risking suboptimal behavior, or represent those values explicitly thereby…
Subadditive set functions play a pivotal role in computational economics (especially in combinatorial auctions), combinatorial optimization or artificial intelligence applications such as interpretable machine learning. However, specifying…
Q-Learning is a fundamental off-policy reinforcement learning (RL) algorithm that has the objective of approximating action-value functions in order to learn optimal policies. Nonetheless, it has difficulties in reconciling bias with…
The partition functions $P(n,m,p)$, the number of integer partitions of $n$ into exactly $m$ parts with each part at most $p$, and $Q(n,m,p)$, the number of integer partitons of $n$ into exactly $m$ distinct parts with each part at most…
Subdifferentials (in the sense of convex analysis) of matrix-valued functions defined on $\mathbb{R}^d$ that are convex with respect to the L\"{o}wner partial order can have a complicated structure and might be very difficult to compute…
Using $P(n,m)$, the number of integer partitions of $n$ into exactly $m$ parts, which was the subject of an earlier paper, $P(n,m,p)$, the number of integer partitions of $n$ into exactly $m$ parts with each part at most $p$, can be…
We classify module categories over the category of representations of quantum $SL(2)$ in a case when $q$ is not a root of unity. In a case when $q$ is a root of unity we classify module categories over the semisimple subquotient of the same…
Factorial moments are convenient tools in nuclear physics to characterize the multiplicity distributions when phase-space resolution ($\Delta$) becomes small. For uncorrelated particle production within $\Delta$, Gaussian statistics holds…
In this paper we study the truncation $\nu_q$ of a valuation $\nu$ on a polynomial $q$. It is known that when $q$ is a key polynomial, then $\nu_q$ is a valuation. It is also known that the converse does not hold. We show that when $q$ is a…
Data valuation -- quantifying the contribution of individual data sources to certain predictive behaviors of a model -- is of great importance to enhancing the transparency of machine learning and designing incentive systems for data…
Schur's $Q$-functions with reduced variables are discussed by employing a combinatorics of strict partitions. They are called reduced $Q$-functions. We give a description of the linear relations among reduced $Q$-functions.
By exploiting the connection between scattered $\mathbb{F}_q$-subspaces of $\mathbb{F}_{q^m}^3$ and minimal non degenerate $3$-dimensional rank metric codes of $\mathbb{F}_{q^m}^{n}$, $n \geq m+2$, described in [2], we will exhibit a new…
The aim of this paper is to build a theory of commutative and noncommutative {\it injective} valuations of various algebras (including algebras with zero divisors). The targets of our valuations are (well-)ordered commutative and…
An {\em $m\times n$ row-column factorial design} is an arrangement of the elements of a factorial design into a rectangular array. Such an array is used in experimental design, where the rows and columns can act as blocking factors. If for…
For a positive real $\alpha$, we can consider the additive submonoid $M$ of the real line that is generated by the nonnegative powers of $\alpha$. When $\alpha$ is transcendental, $M$ is a unique factorization monoid. However, when $\alpha$…