English
Related papers

Related papers: On constraints and dividing in ternary homogeneous…

200 papers

We describe symmetry structure of a general singular theory (theory with constraints in the Hamiltonian formulation), and, in particular, we relate the structure of gauge transformations with the constraint structure. We show that any…

High Energy Physics - Theory · Physics 2007-05-23 D. M. Gitman , I. V. Tyutin

We show that an arbitrary algebra ${ A}$, (of arbitrary dimension, over an arbitrary base field and any identity is not suppose for the product), is semisimple if and only if it has zero annihilator and admits a semi-division linear basis.…

Rings and Algebras · Mathematics 2024-10-04 Antonio J. Calderon Martin

We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…

Probability · Mathematics 2009-03-06 Eugenijus Manstavičius

Let G be a connected linear algebraic group over an algebraically closed field k, and let H be a connected closed subgroup of G. We prove that the homogeneous variety G/H is a rational variety over k whenever H is solvable, or when dim(G/H)…

Algebraic Geometry · Mathematics 2018-09-24 CheeWhye Chin , De-Qi Zhang

Just as Lascar's notion of abstract rank axiomatizes the U-rank, we propose axioms for the ranks $SU^d$ and $SU^f$, the foundation ranks of dividing and forking. We study the relationships between these axioms. As with superstable, we…

Logic · Mathematics 2022-02-15 Santiago Cárdenas-Martín , Rafel Farré

Let $n$ be a positive integer, and let $k$ be a field (of arbitrary characteristic) accessible to symbolic computation. We describe an algorithmic test for determining whether or not a finitely presented $k$-algebra $R$ has infinitely many…

Rings and Algebras · Mathematics 2008-07-20 Edward S. Letzter

Let $G$ be a linear algebraic group over a field $k$ of characteristic 0. We show that any two connected semisimple $k$-subgroups of $G$ that are conjugate over an algebraic closure of $k$ are actually conjugate over a finite field…

Group Theory · Mathematics 2018-12-12 Mikhail Borovoi , Christopher Daw , Jinbo Ren

We show that, if A is a separable simple unital C*-algebra which absorbs the Jiang-Su algebra Z tensorially and which has real rank zero and finite decomposition rank, then A is tracially AF in the sense of Lin, without any restriction on…

Operator Algebras · Mathematics 2007-05-23 Wilhelm Winter

We study bounded width algebras which are minimal in the sense that every proper reduct does not have bounded width. We show that minimal bounded width algebras can be arranged into a pseudovariety with one basic ternary operation. We…

Rings and Algebras · Mathematics 2020-02-17 Zarathustra Brady

We develop some basic results about full amalgamation classes with intrinsic trascendentals. These classes have generics whose models may have finite subsets whose intrinsic closure is not contained in its algebraic closure. We will show…

Logic · Mathematics 2015-12-15 Justin Brody

A finite relational structure A is called compact if for any infinite relational structure B of the same type, the existence of a homomorphism from B to A is equivalent to the existence of homomorphisms from all finite substructures of B to…

Logic · Mathematics 2026-03-09 Claude Tardif

Let \Gamma be a structure with a finite relational signature and a first-order definition in (R;*,+) with parameters from R, that is, a relational structure over the real numbers where all relations are semi-algebraic sets. In this article,…

Computational Complexity · Computer Science 2015-07-01 Manuel Bodirsky , Peter Jonsson , Timo von Oertzen

Fusion categories are fundamental objects in quantum algebra, but their definition is narrow in some respects. By definition a fusion category must be k-linear for some field k, and every simple object V is strongly simple, meaning that (V)…

Quantum Algebra · Mathematics 2019-09-16 Greg Kuperberg

We show that every $\mu$-constant family of isolated hypersurface singularities of type f(x) + tg(x), where t is a parameter, is topologically trivial. In the proof we construct explicitely a vector field trivializing the family. The proof…

alg-geom · Mathematics 2007-05-23 Adam Parusinski

We find necessary and sufficient conditions for the finite separability of monogenic rings. As a corollary, we prove that a finitely generated torsion-free PI-ring is finitely separable if and only if its additive group is finitely…

Rings and Algebras · Mathematics 2023-10-03 Stanislav Kublanovsky

In this paper we analyze the relationship between o-minimal structures and the notion of \omega -saturated one dimensional t.t.t structures. We prove that if removing any point from such a structure splits it into more than one definably…

Logic · Mathematics 2012-10-23 Daniel Lowengrub

It is shown that, in the variety of ternary rings, the elements of amalgamated free products have unique normal forms, and, moreover, this variety satisfies the strong amalgamation property. Applying these statements, effective codescent…

Category Theory · Mathematics 2023-08-10 Guram Samsonadze , Dali Zangurashvili

Let K be a number field and let A be its ring of integers. Let G be a connected, noncommutative, absolutely almost simple algebraic K-group. If the K-rank of G equals 2, then G(A[t]) is not finitely presented.

Group Theory · Mathematics 2011-05-04 Amir Mohammadi , Kevin Wortman

We show that every separable simple tracially approximately divisible $C^*$-algebra has strict comparison, is either purely infinite, or has stable rank one. As a consequence, we show that every (non-unital) finite simple ${\cal Z}$-stable…

Operator Algebras · Mathematics 2021-09-07 Xuanlong Fu , Kang Li , Huaxin Lin

K\"onig's lemma is a fundamental result about trees with countless applications in mathematics and computer science. In contrapositive form, it states that if a tree is finitely branching and well-founded (i.e. has no infinite paths), then…

Logic in Computer Science · Computer Science 2026-02-20 Henning Urbat , Thorsten Wißmann
‹ Prev 1 3 4 5 6 7 10 Next ›