Related papers: Metacommutation of primes in Eichler orders
The two main approaches to the study of irreducible representations of orders (via traces and Poisson orders) have so far been applied in a completely independent fashion. We define and study a natural compatibility relation between the two…
The commutation principle of Ramirez, Seeger, and Sossa proved in the setting of Euclidean Jordan algebras says that when the sum of a real valued function $h$ and a spectral function $\Phi$ is minimized/maximized over a spectral set $E$,…
In this paper we present a technical lemma about localization at countable infinitely many prime ideals. We apply this lemma to get many results about the finiteness of associated prime ideals of local cohomology modules.
The article is devoted to questions concerning the problems of compactness of solutions of the Dirichlet problem for the Beltrami equation in some simply connected domain. In terms of prime ends, we have proved results of a detailed form…
A central goal of meta-learning is to find a learning rule that enables fast adaptation across a set of tasks, by learning the appropriate inductive bias for that set. Most meta-learning algorithms try to find a \textit{global} learning…
Let $J$ be an ideal of a noetherian local ring $R$. We show new results on the set of attached primes $\Att_R(\LCMo ^l_J(R))$ of a local cohomology module $\LCMo ^l_J(R)$. To prove our results we establish and use new relations between the…
Generalizing the concept of the Macaulay inverse system, we introduce a way to describe localizations of an ideal in a polynomial ring. This leads to an approach to the differential primary decomposition as a description of the affine…
When iteratively solving linear systems By=b with Hermitian positive semi-definite $B$, and in particular when solving least-squares problems for $Ax=b$ by reformulating them as $AA^\ast y=b$, it is often observed that SOR-type methods…
We study the partial orders induced on Wachs and signed Wachs permutations by the Bruhat and weak orders of the symmetric and hyperoctahedral groups. We show that these orders are graded, determine their rank function, characterize their…
For each permutation $w$, we can construct a collection of hyperplanes $\mathcal{A}_w$ according to the inversions of $w$, which is called the inversion hyperplane arrangement associated to $w$. It was conjectured by Postnikov and confirmed…
This work concerns the stable module category of a finite group over a field of characteristic dividing the group order. The minimal localising tensor ideals correspond to the non-maximal homogeneous prime ideals in the cohomology ring of…
We provide algorithms to count and enumerate representatives of the (right) ideal classes of an Eichler order in a quaternion algebra defined over a number field. We analyze the run time of these algorithms and consider several related…
We present an axiomatic framework for analyzing the algorithmic properties of decision trees. This framework supports the classification of decision tree problems through structural and ancestral constraints within a rigorous mathematical…
Following Lusztig and Vogan, we study the Bruhat $G$-order on the set $\mathcal{D}$ of rank $1$ local systems on $B$-orbits over an Hermitian symmetric variety $G/L$. The main aim is to give a combinatorial characterization similar to the…
We study chains of lattice ideals that are invariant under a symmetric group action. In our setting, the ambient rings for these ideals are polynomial rings which are increasing in (Krull) dimension. Thus, these chains will fail to…
Meta-learning of shared initialization parameters has shown to be highly effective in solving few-shot learning tasks. However, extending the framework to many-shot scenarios, which may further enhance its practicality, has been relatively…
In [1] the authors showed some basic properties of a pre-order that arose in combinatorial number theory, namely the finite embeddability between sets of natural numbers, and they presented its generalization to ultrafilters, which is…
An adjacent $q$-cycle is a natural generalization of an adjacent transposition. We show that the number of adjacent $q$-cycles in a permutation maps to the sum of occurrences of two mesh patterns under Foata's fundamental transformation. As…
The convex transform order is one way to make precise comparison between the skewness of probability distributions on the real line. We establish a simple and complete characterisation of when one Beta distribution is smaller than another…
The theory of Ihara zeta functions is extended to non-compact arithmetic quotients of Bruhat-Tits trees. This new zeta function turns out to be a rational function, despite the infinite-dimensional setting. In general it has zeros and…