English
Related papers

Related papers: Binary primitive homogeneous simple structures

200 papers

We develop the homotopy theory of semisimplicial sets constructively and without reference to point-set topology to obtain a constructive model for $\omega$-groupoids. Most of the development is folklore, but for a few results the author is…

Category Theory · Mathematics 2018-10-01 Christian Sattler

We prove, by means of an exact structural description, that every simple triangle-free binary matroid $M$ with $|M| > \tfrac{33}{128}2^{r(M)}$ has critical number at most $2$.

Combinatorics · Mathematics 2015-09-09 Rutger Campbell , Jim Geelen , Peter Nelson

We present some results on the structure of line graphs of triangle-free graphs and a homogenization of the line graph of the universal homogeneous triangle-free graph in a finite relational language with arity 4. This result is relevant to…

Logic · Mathematics 2021-08-27 Andres Aranda

A cancellative commutative monoid is atomic if every non-invertible element factors into irreducibles. Under certain mild conditions on a positive algebraic number $\alpha$, the additive monoid $M_\alpha$ of the evaluation semiring…

Commutative Algebra · Mathematics 2022-01-05 Nancy Jiang , Bangzheng Li , Sophie Zhu

Recent results of Kahle and Miller give a method of constructing primary decompositions of binomial ideals by first constructing "mesoprimary decompositions" determined by their underlying monoid congruences. Monoid congruences (and…

Commutative Algebra · Mathematics 2018-08-15 Laura Felicia Matusevich , Christopher O'Neill

A simple binary matroid, viewed as a restriction of a finite binary projective geometry $PG(n-1,2)$, is $I_{1,t}$-free if for any rank-$t$ flat of $PG(n-1,2)$, its intersection with the matroid is not a one-element set. In this paper, we…

Combinatorics · Mathematics 2020-11-16 Peter Nelson , Kazuhiro Nomoto

Patterns on numerical semigroups are multivariate linear polynomials, and they are said to be admissible if there exists a numerical semigroup such that evaluated at any nonincreasing sequence of elements of the semigroup gives integers…

Number Theory · Mathematics 2012-11-06 Maria Bras-Amorós , Pedro A. García-Sánchez , Albert Vico-Oton

We prove the existence of primitive sets (sets of integers in which no element divides another) in which the gap between any two consecutive terms is substantially smaller than the best known upper bound for the gaps in the sequence of…

Number Theory · Mathematics 2019-02-06 Nathan McNew

The space of 6D supergravities with minimal supersymmetry is greatly constrained by anomaly cancellation. Nevertheless, a large number of models satisfy all low-energy consistency conditions and in this work we make progress towards…

High Energy Physics - Theory · Physics 2024-04-16 Yuta Hamada , Gregory J. Loges

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

Suppose A is a unital subhomogeneous C*-algebra. We show that every central sequence in A is hypercentral if and only if every pointwise limit of a sequence of irreducible representations is multiplicity free. We also show that every…

Operator Algebras · Mathematics 2020-07-21 Don Hadwin , Hemant Pendharkar

Let F be a non-abelian finite rank free group, and let H_g be the fundamental group of a surface of genus g with one boundary component represented by D_g in H_g. So, H_g is the free group <a_1,b_1,...,a_g,b_g> and D_g is the product of…

Geometric Topology · Mathematics 2007-05-23 Mladen Bestvina , Mark Feighn

We derive a new sufficient condition for the existence of {\omega}-categorical universal structures in classes of relational structures with constraints, augmenting results by Cherlin, Shelah, Chi, and Hubi\v{c}ka and Ne\v{s}et\v{r}il.…

Logic · Mathematics 2012-03-29 Christian Pech , Maja Pech

Very sparse random graphs are known to typically be singular (i.e., have singular adjacency matrix), due to the presence of "low-degree dependencies'' such as isolated vertices and pairs of degree-1 vertices with the same neighbourhood. We…

Probability · Mathematics 2024-03-27 Asaf Ferber , Matthew Kwan , Ashwin Sah , Mehtaab Sawhney

A graph $G$ is $H$-free if it does not contain an induced subgraph isomorphic to $H$. The study of the typical structure of $H$-free graphs was initiated by Erd\H{o}s, Kleitman and Rothschild, who have shown that almost all $C_3$-free…

Combinatorics · Mathematics 2020-07-03 Sergey Norin , Yelena Yuditsky

We define a class of algebras describing links of binary semi-isolating formulas on a set of realizations for a family of 1-types of a complete theory. These algebras include algebras of isolating formulas considered before. We prove that a…

Logic · Mathematics 2012-10-16 Sergey V. Sudoplatov

An equivalence structure is a set with a single binary relation, satisfying sentences stating that the relation is an equivalence relation. A computable structure A is said to be $\Delta^0_\alpha$ categorical if for any computable structure…

Logic · Mathematics 2008-05-14 W. Calvert , D. Cenzer , V. S. Harizanov , A. Morozov

A structure M is pregeometric if the algebraic closure is a pregeometry in all M' elementarily equivalent to M. We define a generalisation: structures with an existential matroid. The main examples are superstable groups of U-rank a power…

Logic · Mathematics 2011-04-12 Antongiulio Fornasiero

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

Let (L;C) be the (up to isomorphism unique) countable homogeneous structure carrying a binary branching C-relation. We study the reducts of (L;C), i.e., the structures with domain L that are first-order definable in (L;C). We show that up…

Logic · Mathematics 2016-02-26 Manuel Bodirsky , Peter Jonsson , Trung Van Pham
‹ Prev 1 4 5 6 7 8 10 Next ›