相关论文: A Pascal-like Bound for the Number of Necklaces wi…
Over fields of arbitrary characteristic we classify all braid-indecomposable tuples of at least two absolutely simple Yetter-Drinfeld modules over non-abelian groups such that the group is generated by the support of the tuple and the…
The density of a rational language can be understood as the frequency of some "pattern" in the shift space, for example a pattern like "words with an even number of a given letter." We study the density of group languages, i.e. rational…
Consider these two distinct combinatorial objects: (1) the necklaces of length $n$ with at most $q$ colors, and (2) the multisets of integers modulo $n$ with subset sum divisible by $n$ and with the multiplicity of each element being…
An identity that relates multipolar solutions of the Einstein equations to Newtonian potentials of bars with linear densities proportional to Legendre polynomials is used to construct analytical potential-density pairs of infinitesimally…
This paper establishes an interesting link between $k$th price auctions and Catalan numbers by showing that for distributions that have linear density, the bid function at any symmetric, increasing equilibrium of a $k$th price auction with…
Recently, a new characterization of Lyndon words that are also perfectly clustering was proposed by Lapointe and Reutenauer (2024). A word over a ternary alphabet {a,b,c} is called perfectly clustering Lyndon if and only if it is the…
We introduce a technique to compute probably approximately correct (PAC) bounds on precision and recall for matching algorithms. The bounds require some verified matches, but those matches may be used to develop the algorithms. The bounds…
Menon's proof of the preservation of log-concavity of sequences under convolution becomes simpler when adapted to 2-sided infinite sequences. Under assumption of log-concavity of two 2-sided infinite sequences, the existence of the…
We review and compare five ways of assigning totally ordered sizes to subsets of the natural numbers: cardinality, infinite lottery logic with mirror cardinalities, natural density, generalised density, and $\alpha$-numerosity. Generalised…
We study the complexity of multiplication in noncommutative group algebras which is closely related to the complexity of matrix multiplication. We characterize such semisimple group algebras of the minimal bilinear complexity and show…
We extend classical density theorems of Borel and Dani--Shalom on lattices in semisimple, respectively solvable algebraic groups over local fields to approximate lattices. Our proofs are based on the observation that Zariski closures of…
As it is known, universal codes, which estimate the entropy rate consistently, exist for stationary ergodic sources over finite alphabets but not over countably infinite ones. We generalize universal coding as the problem of universal…
This paper introduces a generic framework that provides sufficient conditions for guaranteeing polynomial-time decidability of fixed-negation fragments of first-order theories that adhere to certain fixed-parameter tractability…
For arbitrary nontrivial linear combinations of a finite number of Poisson kernels, the fulfillment of the Nagy condition is established for all numbers n, starting from some number. It is also proved for any n the existence of linear…
In a vertex algebra setting, we consider non-local screening operators associated to the basis of any non-integral lattice. We have previously shown that, under certain restrictions, these screening operators satisfy the relations of a…
A rule due to Bravais of wide validity for crystals is that their surfaces correspond to the densest planes of atoms in the bulk of the material. Comparing a theoretical model of i-AlPdMn with experimental results, we find that this…
We study the concept of density for sets of natural numbers in some lacunary $A$-convergent sequence spaces. Also we are trying to investigate some relation between the ordinary convergence and module statistical convergence for evey…
Correlation measure of order $k$ is an important measure of randomness in binary sequences. This measure tries to look for dependence between several shifted version of a sequence. We study the relation between the correlation measure of…
In this paper, we continue to investigate finite-dimensional Nichols algebras over simple Yetter-Drinfeld modules of the Suzuki algebras $A_{N\, n}^{\mu\lambda}$. It is finished for the case $A_{N\, 2n}^{\mu\lambda}$. As for the case…
We consider discrete orthogonal polynomial ensembles which are discrete analogues of the orthogonal polynomial ensembles in random matrix theory. These ensembles occur in certain problems in combinatorial probability and can be thought of…