Related papers: Extensions of partial cyclic orders, Euler numbers…

We give an incremental polynomial time algorithm for enumerating the vertices of any polyhedron $\mathcal{P}(A,\mathbf{1})=\{x\in\RR^n \mid Ax\geq \b1,~x\geq \b0\}$, when $A$ is a totally unimodular matrix. Our algorithm is based on…

The unique third-order invariant variational equation in three-dimensional (pseudo)Euclidean space is derived.

In this paper, several families of irreducible constacyclic codes over finite fields and their duals are studied. The weight distributions of these irreducible constacyclic codes and the parameters of their duals are settled. Several…

Let $n$ be a non-negative integer and $A=\{a_1,\ldots,a_k\}$ be a multi-set with $k$ not necessarily distinct members, where $a_1\leqslant\ldots\leqslant a_k$. We denote by $\Delta(n,A)$ the number of ways to partition $n$ as the form…

We consider the well-studied pattern counting problem: given a permutation $\pi \in \mathbb{S}_n$ and an integer $k > 1$, count the number of order-isomorphic occurrences of every pattern $\tau \in \mathbb{S}_k$ in $\pi$. Our first result…

In these lectures we study some possible higher order (of degree greater than two) extensions of the Poincar\'e algebra. We first give some general properties of Lie superalgebras with some emphasis on the supersymmetric extension of the…

We adapt a known technique for searching for ideal classes of arbitrary order and then apply it to three families of number fields. We show that a family of cyclic sextic number fields has infinitely many fields in it that contain a…

We prove that almost all real numbers (with respect to Lebesgue measure) are approximated by the convergents of their $\beta$-expansions with the exponential order $\beta^{-n}$. Moreover, the Hausdorff dimensions of sets of the real numbers…

Let m>=1 be an arbitrary fixed integer and let N_m(x) count the number of odd integers u<=x such that the order of 2 modulo u is not divisible by m. In case m is prime estimates for N_m(x) were given by H. Mueller that were subsequently…

Consider the following curious puzzle: call an n-tuple X=(X_1, ..., X_n) of sets smaller than another n-tuple Y if it has fewer //unordered sections//. We show that equivalence classes for this preorder are very easy to describe and…

The volume of a cyclic polytope can be obtained by forming an iterated integral along a suitable piecewise linear path running through its edges. Different choices of such a path are related by the action of a subgroup of the combinatorial…

We use groups with triality to construct a series of nonassociative Moufang loops. Certain members of this series contain an abelian normal subloop with the corresponding quotient being a cyclic group. In particular, we give a new series of…

This paper initiates the study of shortening universal cycles (u-cycles) and universal words (u-words) for permutations either by using incomparable elements, or by using non-deterministic symbols. The latter approach is similar in nature…

Self-dual cyclic codes form an important class of linear codes. It has been shown that there exists a self-dual cyclic code of length $n$ over a finite field if and only if $n$ and the field characteristic are even. The enumeration of such…

For a vector field F on the Euclidean plane we construct, under certain assumptions on F, an ordered model-theoretic structure associated to the flow of F. We do this in such a way that the set of all limit cycles of F is represented by a…

In this paper, we investigate polycyclic codes associated with a trinomial of arbitrary degree $n$ over a finite chain ring $ R.$ We extend the concepts of $ n $-isometry and $ n $-equivalence known for constacyclic codes to this class of…

Cyclic codes are an interesting type of linear codes and have applications in communication and storage systems due to their efficient encoding and decoding algorithms. They have been studied for decades and a lot of progress has been made.…

We compute the expansion of the cohomology class of the permutahedral variety in the basis of Schubert classes. The resulting structure constants $a_w$ are expressed as a sum of \emph{normalized} mixed Eulerian numbers indexed naturally by…

We derive new formulas for the number of unordered (distinct) factorizations with $k$ parts of a positive integer $n$ as sums over the partitions of $k$ and an auxiliary function, the number of partitions of the prime exponents of $n$,…

Let $\mathbb{F}_{p^m}$ be a finite field of cardinality $p^m$ where $p$ is an odd prime, $n$ be a positive integer satisfying ${\rm gcd}(n,p)=1$, and denote $R=\mathbb{F}_{p^m}[u]/\langle u^e\rangle$ where $e\geq 4$ be an even integer. Let…