Related papers: Counting compatible indexing systems for $C_{p^n}$
We study associative multiplications in semi-simple associative algebras over C compatible with the usual one. An interesting class of such multiplications is related to the affine Dynkin diagrams of A, D, E-type. In this paper we…
We present an alternative cyclic proof system for Peano arithmetic that could be simpler than the existing ones and well-adapted both for proof analysis and for automatizing inductive proof search. In addition, we will show how various…
Consider a permutation p to be any finite list of distinct positive integers. A statistic is a function St whose domain is all permutations. Let S(p,q) be the set of shuffles of two disjoint permutations p and q. We say that St is shuffle…
We prove an index theorem for families of linear periodic Hamiltonian systems, which is reminiscent of the Atiyah-Singer index theorem for selfadjoint elliptic operators. For the special case of one-parameter families, we compare our…
We find a new approach to computing the remainder of a polynomial modulo $x^n-1$; such a computation is called modular enumeration. Given a polynomial with coefficients from a commutative $\mathbb{Q}$-algebra, our first main result…
For a fixed positive integer n, let S_n denote the symmetric group of n! permutations on n symbols, and let maj(sigma) denote the major index of a permutation sigma. For positive integers k<m not greater than n and non-negative integers i…
We introduce a non-symmetric operad $\mathcal{N}$, whose dimension in degree $n$ is given by the Catalan number $c_{n-1}$. It arises naturally in the study of coalgebra structures defined on compatible associative algebras. We prove that…
We advertise elementary symmetric polynomials $e_i$ as the natural basis for generating series $A_{g,n}$ of intersection numbers of genus g and n marked points. Closed formulae for $A_{g,n}$ are known for genera $0$ and $1$ -- this approach…
This paper establishes a new Chebyshev criterion for some family of integrals. By virtue of this criterion we obtain several new Chebyshev families. With the help of these new families we can answer the conjecture posed by Gasull et al in…
A two-parameter family of exchangeable partitions with a simple updating rule is introduced. The partition is identified with a randomized version of a standard symmetric Dirichlet species-sampling model with finitely many types. A…
In this paper, plane polynomial systems having a singular point attracting all orbits in positive time are classified up to topological equivalence. This is done by assigning a combinatorial invariant to the system (a so-called "feasible…
This paper presents both a proof method and a result. The proof method presented is particularly suitable for uniformly proving families of identities satisfied by a family of recursive sequences. To illustrate the method, we study the…
We give several families of polynomials which are related by Eulerian summation operators. They satisfy interesting combinatorial properties like being integer-valued at integral points. This involves nearby-symmetries and a recursion for…
This contains a new version of the so-called non-commutative Gauss algorithm for polycyclic groups. Its results allow to read off the order and the index of a subgroup in an (possibly infinite) polycyclic group.
This paper presents a novel perspective on correlation functions in the clustering analysis of the large-scale structure of the universe. We first recognise that pair counting in bins of radial separation is equivalent to evaluating…
Floating-point addition on a finite-precision machine is not associative, so not all mathematically equivalent summations are computationally equivalent. Making this assumption can lead to numerical error in computations. Proper ordering…
In order to induce a family of mixing patterns of leptons which accommodate the experimental data with a simple mathematical construct, we construct a novel object from the hybrid of two elements of a finite group with a parameter $\theta$.…
We establish a complete classification of binary group codes with complementary duals for a finite group and explicitly determine the number of linear complementary dual (LCD) cyclic group codes by using cyclotomic cosets. The dimension and…
We use a cluster ensemble to determine the number of clusters, k, in a group of data. A consensus similarity matrix is formed from the ensemble using multiple algorithms and several values for k. A random walk is induced on the graph…
Indexing massive data sets is extremely expensive for large scale problems. In many fields, huge amounts of data are currently generated, however extracting meaningful information from voluminous data sets, such as computing similarity…