English
Related papers

Related papers: Domination, fibrations and splitting

200 papers

We deal with the systematic development of stability for the context of approximate elementary submodels of a monster metric space, which is not far, but still very distinct from the first order case. In particular we prove the analogue of…

Logic · Mathematics 2007-05-23 Saharon Shelah , Alex Usvyatsov

A left and right noetherian semiperfect ring R is known to be indecomposable if and only if its factor by the second power of Jacobson radical is. This characterisation is used to study simple R-modules in terms of their Ext groups. It is…

Rings and Algebras · Mathematics 2024-12-16 Dominik Krasula

We clarify quasi-Frobenius configurations of finite Morley rank. 1. We remove one assumption in an identification theorem by Zamour while simplifying the proof. 2. We show that a strongly embedded quasi-Frobenius configuration of odd type,…

Logic · Mathematics 2023-05-02 Tuna Altinel , Luis Jaime Corredor , Adrien Deloro

We classify possible supersymmetry-preserving relevant, marginal, and irrelevant deformations of unitary superconformal theories in $d \geq 3$ dimensions. Our method only relies on symmetries and unitarity. Hence, the results are model…

High Energy Physics - Theory · Physics 2016-12-21 Clay Cordova , Thomas T. Dumitrescu , Kenneth Intriligator

Semidefinite programs (SDPs) often arise in relaxations of some NP-hard problems, and if the solution of the SDP obeys certain rank constraints, the relaxation will be tight. Decomposition methods based on chordal sparsity have already been…

Optimization and Control · Mathematics 2020-09-17 Jared Miller , Yang Zheng , Biel Roig-Solvas , Mario Sznaier , Antonis Papachristodoulou

In this paper we define and study self-similar ranked fragmentations. We first show that any ranked fragmentation is the image of some partition-valued fragmentation, and that there is in fact a one-to-one correspondence between the laws of…

Probability · Mathematics 2007-05-23 Julien Berestycki

In this paper, we describe a low-rank matrix completion method based on matrix decomposition. An incomplete matrix is decomposed into submatrices which are filled with a proposed trimming step and then are recombined to form a low-rank…

Numerical Analysis · Mathematics 2010-06-29 Rick Ma , Samuel Cheng

Using a new definition of rank for representations of semisimple groups sharp results are proved for the decay of matrix coefficients of unitary representations of two types of non-split $p$-adic simple algebraic groups of exceptional type.…

Representation Theory · Mathematics 2007-05-23 Hadi Salmasian

There is both theoretical and numerical evidence that the set of irreducible representations of a reductive group over local or finite fields is naturally partitioned into families according to analytic properties of representations.…

Representation Theory · Mathematics 2021-05-25 Shamgar Gurevich , Roger Howe

In this article, we take a closer look at the reliability of large minimal networks constructed by repeated compositions of the simplest possible networks. For a given number of devices $n=2^m$ we define the set of all the possible…

Discrete Mathematics · Computer Science 2021-12-14 Vlad-Florin Dragoi , Valeriu Beiu

This paper addresses some questions about dimension theory for P-minimal structures. We show that, for any definable set A, the dimension of the frontier of A is strictly smaller than the dimension of A itself, and that A has a…

Logic · Mathematics 2015-09-01 Pablo Cubides-Kovacsics , Luck Darnière , Eva Leenknegt

Here we analyze a proper 2-generated core in a minimal counter example to the Cherlin-Zilber Algebraicity Conjecture for simple groups of finite Morley rank. We ultimately show that such a group is strongly embedded and the ambiant group is…

Group Theory · Mathematics 2014-02-26 Alexandre Borovik , Jeffrey Burdges , Ali Nesin

The splitting principle states that morphisms in a derived category do not "split" accidentally. This has been successsfully applied in several characterizations of rational, DB, and other singularities. In this article I prove a general…

Algebraic Geometry · Mathematics 2011-08-09 Sándor J Kovács

We introduce a new notion called generalized dominated splitting which is weaker than classical dominated splitting. We use this notion to generalize a result of Zhang\cite{Zh}: every diffeomorphism with nontrivial global generalized…

Dynamical Systems · Mathematics 2011-06-21 Xueting Tian

The main objective of this paper is to extend Morse-Forman theory to vector-valued functions. This is mostly motivated by the need to develop new tools and methods to compute multiparameter persistence. To generalize the theory, in addition…

Geometric Topology · Mathematics 2024-05-17 Guillaume Brouillette , Madjid Allili , Tomasz Kaczynski

We give a representation for regular forms associated with dominated $C_0$-semigroups which, in turn, characterises domination of $C_0$-semigroups associated with regular forms. In addition, we prove a relationship between the positivity of…

Functional Analysis · Mathematics 2024-04-12 Sahiba Arora , Ralph Chill , Jean-Daniel Djida

In this paper we study the algebraic structure of $\omega$-stable bilinear maps, arbitrary rings and nilpotent groups. We will also provide rather complete structure theorems for the above structures in the finite Morley rank case.

Group Theory · Mathematics 2016-05-16 Alexei G. Myasnikov , Mahmood Sohrabi

Let alpha = (a,b,...) be a composition. Consider the associated poset F(alpha), called a fence, whose covering relations are x_1 < x_2 < ... < x_{a+1} > x_{a+2} > ... > x_{a+b+1} < x_{a+b+2} < ... . We study the associated distributive…

Combinatorics · Mathematics 2020-09-01 Thomas McConville , Bruce E. Sagan , Clifford Smyth

An expansive, monotone operator is dominating; if it is also idempotent it is a closure operator. Although they have distinct properties, these two kinds of discrete operators are also intertwined. Every closure operator is dominating;…

Combinatorics · Mathematics 2015-01-14 John L. Pfaltz

A lattice $L$ is said lowly finite if the set $[\mathsf{0},a]$ is finite for every element $a$ of $L$. We mainly aim to provide a complete proof that, if $M$ is a subset of a complete lowly finite distributive lattice $L$ containing its…

Combinatorics · Mathematics 2021-01-19 Hery Randriamaro
‹ Prev 1 3 4 5 6 7 10 Next ›