Results 41 to 50 of about 6,775 (103)

Generic Expression Hardness Results for Primitive Positive Formula Comparison [PDF]

open access: yes, 2011
We study the expression complexity of two basic problems involving the comparison of primitive positive formulas: equivalence and containment. In particular, we study the complexity of these problems relative to finite relational structures.
Bova, Simone   +2 more
core  

Exact solutions for Bianchi type cosmological metrics, Weyl orbits of E_{8(8)} subalgebras and p--branes

open access: yes, 2003
In this paper we pursue further a programme initiated in a previous work and aimed at the construction, classification and property investigation of time dependent solutions of supergravity (superstring backgrounds) through a systematic exploitation of U-
Andrianopoli   +52 more
core   +1 more source

Decomposition numbers for abelian defect RoCK blocks of double covers of symmetric groups

open access: yesJournal of the London Mathematical Society, Volume 109, Issue 2, February 2024.
Abstract We calculate the (super)decomposition matrix for a RoCK block of a double cover of the symmetric group with abelian defect, verifying a conjecture of the first author. To do this, we exploit a theorem of the second author and Livesey that a RoCK block Bρ,d$\mathcal {B}^{\rho,d}$ is Morita superequivalent to a wreath superproduct of a certain ...
Matthew Fayers   +2 more
wiley   +1 more source

Deciding absorption

open access: yes, 2015
We characterize absorption in finite idempotent algebras by means of J\'onsson absorption and cube term blockers. As an application we show that it is decidable whether a given subset is an absorbing subuniverse of an algebra given by the tables of its ...
Barto, Libor, Kazda, Alexandr
core   +1 more source

CONGRUENCE SUBGROUPS OF BRAID GROUPS AND CRYSTALLOGRAPHIC QUOTIENTS. PART I [PDF]

open access: yesJournal of the Australian Mathematical Society
This paper is the first of a two part series devoted to describing relations between congruence and crystallographic braid groups. We recall and introduce some elements belonging to congruence braid groups and we establish some (iso)-morphisms between ...
P. Bellingeri   +3 more
semanticscholar   +1 more source

A p$p$‐adic approach to the existence of level‐raising congruences

open access: yesProceedings of the London Mathematical Society, Volume 128, Issue 2, February 2024.
Abstract We construct level‐raising congruences between p$p$‐ordinary automorphic representations, and apply this to the problem of symmetric power functoriality for Hilbert modular forms. In particular, we prove the existence of the nth$n\text{th}$ symmetric power lift of a Hilbert modular eigenform of regular weight for each odd integer n=1,3,⋯,25$n =
Jack A. Thorne
wiley   +1 more source

Equivariant resolutions over Veronese rings

open access: yesJournal of the London Mathematical Society, Volume 109, Issue 1, January 2024.
Abstract Working in a polynomial ring S=k[x1,…,xn]$S={\mathbf {k}}[x_1,\ldots ,x_n]$, where k${\mathbf {k}}$ is an arbitrary commutative ring with 1, we consider the d$d$th Veronese subalgebras R=S(d)$R={S^{(d)}}$, as well as natural R$R$‐submodules M=S(⩾r,d)$M={S^{({\geqslant r},{d})}}$ inside S$S$.
Ayah Almousa   +4 more
wiley   +1 more source

Soft Congruence Relations over Rings

open access: yesTheScientificWorldJournal, 2014
Molodtsov introduced the concept of soft sets, which can be seen as a new mathematical tool for dealing with uncertainty. In this paper, we initiate the study of soft congruence relations by using the soft set theory.
X. Xin, Wenting Li
semanticscholar   +1 more source

Finite Abelian algebras are fully dualizable

open access: yes, 2015
We show that every finite Abelian algebra A from congruence-permutable varieties admits a full duality. In the process, we prove that A also allows a strong duality, and that the duality may be induced by a dualizing structure of finite type.
Bentz, Wolfram   +2 more
core  

The geometries of Jordan nets and Jordan webs. [PDF]

open access: yesAnn Mat Pura Appl, 2022
Bik A, Eisenmann H, Eisenmann H.
europepmc   +1 more source

Home - About - Disclaimer - Privacy