Related papers: Metacommutation of primes in Eichler orders
For a finite field extension $F/\mathbb{Q}_p$ we associate a coefficient system attached on the Bruhat-Tits tree of $G:= {\rm GL}_2(F)$ to a locally analytic representation $V$ of $G$. This is done in analogy to the work of Schneider and…
This paper studies the distributed optimization problem when the objective functions might be nondifferentiable and subject to heterogeneous set constraints. Unlike existing subgradient methods, we focus on the case when the exact…
This thesis comes within the scope of algebraic combinatorics and studies problems related to three orders on permutations: the two said weak orders (right and left) and the strong order or Bruhat order. The first part deals with bases of…
Let $I$ and $J$ be two ideals of a commutative Noetherian ring $R$ and $M$ be an $R$-module of dimension $d$. If $R$ is a complete local ring and $M$ is finite, then attached prime ideals of $H^{d-1}_{I,J}(M)$ are computed by means of the…
It was recently shown that arbitrary first-order models canonically extend to models (of the same language) consisting of ultrafilters. The main precursor of this construction was the extension of semigroups to semigroups of ultrafilters, a…
This is a survey of "Iterated Local Search", a general purpose metaheuristic for finding good solutions of combinatorial optimization problems. It is based on building a sequence of (locally optimal) solutions by: (1) perturbing the current…
We investigate permutations in terms of their cycle structure and descent set. To do this, we generalize the classical bijection of Gessel and Reutenauer to deal with permutations that have some ascending and some descending blocks. We then…
We consider random permutations derived by sampling from stick-breaking partitions of the unit interval. The cycle structure of such a permutation can be associated with the path of a decreasing Markov chain on $n$ integers. Under certain…
Perfect sorting by reversals, a problem originating in computational genomics, is the process of sorting a signed permutation to either the identity or to the reversed identity permutation, by a sequence of reversals that do not break any…
We study the correspondence assigning the vertices of a certain quotient of the local Bruhat-Tits tree for the general linear group over a global function field, to conjugacy classes of maximal orders in some quaternion algebras. The…
Multilayer transformer networks consist of interleaved self-attention and feedforward sublayers. Could ordering the sublayers in a different pattern lead to better performance? We generate randomly ordered transformers and train them with…
The periodic (ordinal) patterns of a map are the permutations realized by the relative order of the points in its periodic orbits. We give a combinatorial characterization of the periodic patterns of an arbitrary signed shift, in terms of…
We consider the overlap of Bethe vectors of the XXX spin chain with a diagonal twist and the modified Bethe vectors with a general twist. We find a determinant representation for this overlap under one additional condition on the twist…
The (strong) Bruhat order for permutations provides a partial ordering defined as follows: two permutations are comparable if one can be obtained from the other by a sequence of adjacent transpositions that each increase the number of…
We study the problem of minimizing a sum of local objective convex functions over a network of processors/agents. This problem naturally calls for distributed optimization algorithms, in which the agents cooperatively solve the problem…
Let $(R,\mathfrak{m})$ be a Noetherian local ring and $I$ an ideal of $R$. We study how local cohomology modules with support in $\mathfrak{m}$ change for small perturbations $J$ of $I$, that is, for ideals $J$ such that $I\equiv J\bmod…
In this note we investigate correlation inequalities for `up-sets' of permutations, in the spirit of the Harris--Kleitman inequality. We focus on two well-studied partial orders on $S_n$, giving rise to differing notions of up-sets. Our…
We initiate the study of sorting permutations using prefix block-interchanges, which exchange any prefix of a permutation with another non-intersecting interval. The goal is to transform a given permutation into the identity permutation…
The focus of the paper is the behavior under iterations of the filtered and local Floer homology of a Hamiltonian on a symplectically aspherical manifold. The Floer homology of an iterated Hamiltonian comes with a natural cyclic group…
Applying local search algorithms to combinatorial optimization problems is not an easy feat. Typically, human intervention is required to compile the constraints to input data for some metaheuristic algorithm. In this paper, we establish a…