Related papers: Metacommutation of primes in Eichler orders
A natural partial order on the set of prime numbers was derived by the author from the internal symmetries of the primary finite fields, independently of Ford a.a., who investigated Pratt trees for primality tests. It leads to a…
Permutation polynomials of finite fields have many applications in Coding Theory, Cryptography and Combinatorics. In the first part of this paper we present a new family of local permutation polynomials based on a class of symmetric…
In [4] we describe a variation of the classical permutation decoding algorithm that can be applied to any binary affine-invariant code; in particular, it can be applied to first-order Reed-Muller codes successfully. In this paper we study…
For a commutative unital ring $R$ with fixed ideals $I$ and $J$, we introduce and study $I$-prime $R$-modules and $(I, J)$-prime $R$-modules together with their duals $I$-coprime $R$-modules and $(I,J)$-coprime $R$-modules respectively. We…
We consider uniform random permutations in classes having a finite combinatorial specification for the substitution decomposition. These classes include (but are not limited to) all permutation classes with a finite number of simple…
Bitstrings can be permuted via permutations and compared via the lexicographic order. In this paper we study the complexity of finding a minimum of a bitstring via given permutations. As a global optima is known to be NP-complete, we study…
We show that the iterates generated by a generic first-order meta-algorithm satisfy a canonical perturbed Fenchel duality inequality. The latter in turn readily yields a unified derivation of the best known convergence rates for various…
The poset of permutations of [n] under Bruhat ordering is studied. We give nontrivial upper and lower bounds for the number of comparable pairs of permutations in both the weak and strong versions of this order. In light of numerical…
We investigate the asymptotic properties of permutations drawn from the Luce model, a natural probabilistic framework in which permutations are generated sequentially by sampling without replacement, with selection probabilities…
A suitable choice of the representation of candidate solutions is crucial for the efficiency of evolutionary algorithms and related metaheuristics. We focus on problems in permutation spaces, which are at the core of numerous practical…
Decision trees are renowned for their ability to achieve high predictive performance while remaining interpretable, especially on tabular data. Traditionally, they are constructed through recursive algorithms, where they partition the data…
We show that the order complex of intervals of a poset, ordered by inclusion, is a Tchebyshev triangulation of the order complex of the original poset. Besides studying the properties of this transformation, we show that the dual of the…
We consider uniform random permutations in proper substitution-closed classes and study their limiting behavior in the sense of permutons. The limit depends on the generating series of the simple permutations in the class. Under a mild…
The paper describes a general glance to the use of element exchange techniques for optimization over permutations. A multi-level description of problems is proposed which is a fundamental to understand nature and complexity of optimization…
Cohn and Kumar showed the quadratic character of $q$ modulo $p$ gives the sign of the permutation of Hurwitz primes of norm $p$ induced by the Hurwitz primes of norm $q$ under metacommutation. We demonstrate that these permutations are…
Conventional optimization methods in machine learning and controls rely heavily on first-order update rules. Selecting the right method and hyperparameters for a particular task often involves trial-and-error or practitioner intuition,…
The higher Bruhat orders are partial orders that generalize the weak order on the symmetric group $S_n$, and the second higher Bruhat order is a poset on commutation classes of reduced words for the longest element in $S_n$, where covering…
We study the extent to which the quotient of the Bruhat-Tits tree at one place $Q$, associated to a genus of orders of maximal rank, can be computed from the analogous quotient at a different place $P$. We show that this computation can be…
Let $\mathfrak{q}$ denote an ideal of a local ring $(A,\mathfrak{m})$. For a system of elements $\underline{a} = a_1,\ldots,a_t$ such that $a_i \in \mathfrak{q}^{c_i}, i = 1, \ldots,t,$ and $n \in \mathbb{Z}$ we investigate a subcomplex…
We collect open problems in permutation patterns on four themes: rank-unimodality in the permutation pattern poset, Wilf-equivalence and shape-Wilf-equivalence, the enumeration of derangements in permutation classes, and sorting by stacks…