English
Related papers

Related papers: On constraints and dividing in ternary homogeneous…

200 papers

A subgroup $H$ of a group $G$ is $commensurated$ in $G$ if for each $g\in G$, $gHg^{-1}\cap H$ has finite index in both $H$ and $gHg^{-1}$. If there is a sequence of subgroups $H=Q_0\prec Q_1\prec ...\prec Q_{k}\prec Q_{k+1}=G$ where $Q_i$…

Group Theory · Mathematics 2016-12-21 Michael Mihalik

We study the existence of uncountable first-order structures that are homogeneous with respect to their finitely generated substructures. In many classical cases this is either well-known or follows from general facts, for example, if the…

Logic · Mathematics 2025-10-21 Adam Bartoš , Wiesław Kubiś

We classify essential algebras whose irredundant non-refinable covers consist of primal algebras. The proof is obtained by constructing one to one correspondence between such algebras and partial orders on finite sets. Further, we prove…

Logic · Mathematics 2014-06-26 Shohei Izawa

Using the language of finite element exterior calculus, we define two families of $H^1$-conforming finite element spaces over pyramids with a parallelogram base. The first family has matching polynomial traces with tensor product elements…

Numerical Analysis · Mathematics 2016-09-13 Andrew Gillette

Let $\cal R$ be an ordered vector space over an ordered division ring. We prove that every definable set $X$ is a finite union of relatively open definable subsets which are definably simply-connected, settling a conjecture from [5]. The…

Logic · Mathematics 2019-10-02 Pantelis E. Eleftheriou

We introduce a new foundation rank based in the relation of dividing between partial types. We call DU to this rank. We also introduce a new way to define the D rank over formulas as a foundation rank. In this way, SU, DU and D are…

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

A relational structure is a core, if all its endomorphisms are embeddings. This notion is important for computational complexity classification of constraint satisfaction problems. It is a fundamental fact that every finite structure has a…

Logic in Computer Science · Computer Science 2017-01-11 Manuel Bodirsky

Let $G$ be a complex simple Lie group and let $\g = \hbox{\rm Lie}\,G$. Let $S(\g)$ be the $G$-module of polynomial functions on $\g$ and let $\hbox{\rm Sing}\,\g$ be the closed algebraic cone of singular elements in $\g$. Let ${\cal L}\s…

Representation Theory · Mathematics 2010-11-16 Bertram Kostant , Nolan Wallach

We prove that a finite von Neumann algebra ${\mathcal A}$ is semisimple if the algebra of affiliated operators ${\mathcal U}$ of ${\mathcal A}$ is semisimple. When ${\mathcal A}$ is not semisimple, we give the upper and lower bounds for the…

Rings and Algebras · Mathematics 2007-10-30 Lia Vas

Let $H$ be a monoid, $\mathscr F(X)$ be the free monoid on a set $X$, and $\pi_H$ be the unique extension of the identity map on $H$ to a monoid homomorphism $\mathscr F(H) \to H$. Given $A \subseteq H$, an $A$-word $\mathfrak z$ (i.e., an…

Rings and Algebras · Mathematics 2024-11-11 Laura Cossu , Salvatore Tringali

Consider an algebraic semigroup $S$ and its closed subscheme of idempotents, $E(S)$. When $S$ is commutative, we show that $E(S)$ is finite and reduced; if in addition $S$ is irreducible, then $E(S)$ is contained in a smallest closed…

Algebraic Geometry · Mathematics 2013-12-23 Michel Brion

We study finitely homogeneous dependent rosy structures, adapting results of Cherlin, Harrington, and Lachlan proved for $\omega$-stable $\omega$-categorical structures. In particular, we prove that such structures have finite {\th}-rank…

Logic · Mathematics 2021-07-07 Alf Onshuus , Pierre Simon

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

Discrete Mathematics · Computer Science 2017-08-08 Emmanuel Jeandel

An algebra $A$ is said to be strongly semisimple if every principal congruence of $A$ is an intersection of maximal congruences. We give a geometrical characterisation of strongly semisimple MV-algebras in terms of Bouligand-Severi…

Metric Geometry · Mathematics 2013-08-01 Leonardo Cabrer

In this paper we classify triangular semisimple and cosemisimple Hopf algebras over any algebraically closed field k. Namely, we construct, for each positive integer N, relatively prime to the characteristic of k if it is positive, a…

Quantum Algebra · Mathematics 2017-05-03 Pavel Etingof , Shlomo Gelaki

A semisimplicial set has face maps but not degeneracies. A basic fact, due to Rourke and Sanderson, is that a semisimplicial set satisfying the Kan condition can be given a simplicial structure. The present paper gives a combinatorial proof…

Algebraic Topology · Mathematics 2012-10-23 James E. McClure

Extending a result of R. de la Vega, we prove that an infinite homogeneous compactum has cardinality $\mathfrak{c}$ if either it is the union of countably many dense or finitely many arbitrary countably tight subspaces. The question if…

General Topology · Mathematics 2016-07-05 István Juhász , Jan van Mill

Two structures $M, N$ in the same language are called probably isomorphic if they (or, in case of metric structures, their completions) are isomorphic after forcing with the Lebesgue measure algebra. We show that, if $M$ and $N$ are…

Logic · Mathematics 2025-07-03 Ilijas Farah , Andrea Vaccaro

In this work we employ machine learning to understand structured mathematical data involving finite groups and derive a theorem about necessary properties of generators of finite simple groups. We create a database of all 2-generated…

Machine Learning · Computer Science 2024-04-16 Yang-Hui He , Vishnu Jejjala , Challenger Mishra , Em Sharnoff

Let $A\subseteq \mathbb{Z}_{\geq 0}$ be a finite set with minimum element $0$, maximum element $m$, and $\ell$ elements strictly in between. Write $(hA)^{(t)}$ for the set of integers that can be written in at least $t$ ways as a sum of $h$…

Combinatorics · Mathematics 2024-12-18 Christian Táfula