English
Related papers

Related papers: On determining when small embeddings of partial St…

200 papers

Partial rigidity is a quantitative notion of recurrence and provides a global obstruction which prevents the system from being strongly mixing. A dynamical system $(X, \mathcal{X}, \mu, T)$ is partially rigid if there is a constant $\delta…

Dynamical Systems · Mathematics 2024-12-13 Tristán Radić

Hierarchical triple systems play a crucial role in various astrophysical contexts, and therefore the understanding of their stability is important. Traditional empirical stability criteria rely on a threshold value of $Q$, the ratio between…

Solar and Stellar Astrophysics · Physics 2025-06-17 Ryutaro Iwakura , Yoko Funato , Junichiro Makino

We study the simultaneous embeddability of a pair of partitions of the same underlying set into disjoint blocks. Each element of the set is mapped to a point in the plane and each block of either of the two partitions is mapped to a region…

Computational Geometry · Computer Science 2014-08-27 Jan Christoph Athenstädt , Tanja Hartmann , Martin Nöllenburg

In tri-partite systems, there are three basic biseparability, $A$-$BC$, $B$-$CA$ and $C$-$AB$ biseparability according to bipartitions of local systems. We begin with three convex sets consisting of these basic biseparable states in the…

Quantum Physics · Physics 2022-04-13 Kil-Chan Ha , Kyung Hoon Han , Seung-Hyeok Kye

Generally, in any human field, a Smarandache Structure on a set A means a weak structure W on A such that there exists a proper subset B which is embedded with a stronger structure S. By proper subset one understands a set included in A,…

General Mathematics · Mathematics 2007-05-23 W. B. Vasantha Kandasamy

An $(n,k)$-Sperner partition system is a set of partitions of some $n$-set such that each partition has $k$ nonempty parts and no part in any partition is a subset of a part in a different partition. The maximum number of partitions in an…

Combinatorics · Mathematics 2020-10-22 Adam Gowty , Daniel Horsley

Two structures are said to be equimorphic if each embeds in the other. Such structures cannot be expected to be isomorphic, and in this paper we investigate the special case of linear orders, here also called chains. In particular we…

Combinatorics · Mathematics 2014-07-11 C. Laflamme , M. Pouzet , R. Woodrow

We extend the classification of mixed states of quantum systems composed of arbitrary number of subsystems of arbitrary dimensions. This extended classification is complete in the sense of partial separability and gives 1+18+1 partial…

Quantum Physics · Physics 2012-10-03 Szilárd Szalay , Zoltán Kökényesi

A set of vertices $W$ in a connected graph $G$ is called a Steiner dominating set if $W$ is both Steiner and dominating set. The Steiner domination number $\gamma_{st}(G)$ is the minimum cardinality of a Steiner dominating set of $G$. A…

Combinatorics · Mathematics 2020-03-02 Yueming Shen , Chengye Zhao , Chenglin Gao , Yunfang Tang

We study a curious class of partitions, the parts of which obey an exceedingly strict congruence condition we refer to as "sequential congruence": the $m$th part is congruent to the $(m+1)$th part modulo $m$, with the smallest part…

Number Theory · Mathematics 2020-06-09 Maxwell Schneider , Robert Schneider

A Steiner quadruple system (briefly $SQS(n)$) is a pair $(X,B)$ where $|X|=n$ and $B$ is a collection of 4-element blocks such that every 3-subset of $X$ is contained in exactly one member of $B$. Hanani \cite{Hanani} proved that the…

Combinatorics · Mathematics 2017-08-04 Vladimir N. Potapov

Let STS(n) denote the number of Steiner triple systems on n vertices, and let F(n) denote the number of 1-factorizations of the complete graph on n vertices. We prove the following upper bound. STS(n) <= ((1 + o(1)) (n/e^2))^(n^2/6) F(n) <=…

Combinatorics · Mathematics 2011-10-13 Nathan Linial , Zur Luria

L\'evai and Pyber proposed the following as a conjecture: Let $G$ be a profinite group such that the set of solutions of the equation $x^n=1$ has positive Haar measure. Then $G$ has an open subgroup $H$ and an element $t$ such that all…

Group Theory · Mathematics 2020-01-22 Meisam Soleimani Malekan , Alireza Abdollahi , Mahdi Ebrahimi

Free Steiner triple systems (STS) are infinite structures that are naturally characterised by a universal property. We consider the class of free STSs from a model theoretic viewpoint. We show that free STSs on any number of generators are…

Logic · Mathematics 2026-02-25 Silvia Barbina , Enrique Casanovas

Given a Stein manifold X of dimension n>1, a discrete sequence a_j in X, and a discrete sequence b_j in C^m where m > [3n/2], there exists a proper holomorphic embedding of X into C^m which sends a_j to b_j for every j=1,2,.... This is the…

Complex Variables · Mathematics 2007-08-16 Franc Forstneric , Bjorn Ivarsson , Frank Kutzschebauch , Jasna Prezelj

The union-closed sets conjecture (Frankl's conjecture) says that for any finite union-closed family of finite sets, other than the family consisting only of the empty set, there exists an element that belongs to at least half of the sets in…

Combinatorics · Mathematics 2019-07-03 Zhen Cui , Ze-Chun Hu

Goldie's Theorem implies that a semiprime left Goldie ring is embeddable into a semisimple Artinian ring. On the other hand, there are domains that are not embeddable into division rings. A criterion for a semiprime ring being embeddable…

Rings and Algebras · Mathematics 2023-12-29 Volodymyr Bavula

A (2+1)-dimensional quasilinear system is said to be `integrable' if it can be decoupled in infinitely many ways into a pair of compatible n-component one-dimensional systems in Riemann invariants. Exact solutions described by these…

Exactly Solvable and Integrable Systems · Physics 2009-11-10 E. V. Ferapontov , K. R. Khusnutdinova

Let $n \in \mathbb{N}_{\geq 2}$. We prove that for every $k \geq 4$ there exist uniform but non-homogeneous Steiner bundles on $\mathbb{P}^n$ of $k$-type with disconnected splitting type, and we further investigate almost-uniform Steiner…

Representation Theory · Mathematics 2025-09-03 Daniel Bissinger

A semiorder is a partially ordered set $P$ with two certain forbidden induced subposets. This paper establishes a bijection between $n$-element semiorders of length $H$ and $(n+1)$-node ordered trees of height $H+1$. This bijection…

Combinatorics · Mathematics 2013-06-28 Yangzhou Hu
‹ Prev 1 8 9 10 Next ›