English
Related papers

Related papers: Many symmetrically indivisible structures

200 papers

For a list assignment $L$ and an $L$-coloring $\varphi$, a Kempe swap in $\varphi$ is \emph{$L$-valid} if it yields another $L$-coloring. Two $L$-colorings are \emph{$L$-equivalent} if we can form one from another by a sequence of $L$-valid…

Combinatorics · Mathematics 2023-11-29 Daniel W. Cranston

Maximal planar graph refers to the planar graph with the most edges, which means no more edges can be added so that the resulting graph is still planar. The Four-Color Conjecture says that every planar graph without loops is 4-colorable.…

General Mathematics · Mathematics 2012-10-26 Jin Xu

We classify the homogeneous finite-dimensional permutation structures, i.e., homogeneous structures in a language of finitely many linear orders, giving a nearly complete answer to a question of Cameron, and confirming the classification…

Logic · Mathematics 2020-02-26 Samuel Braunfeld , Pierre Simon

We show that for every finite colouring of the natural numbers there exists $a,b >1$ such that the triple $\{a,b,a^b\}$ is monochromatic. We go on to show the partition regularity of a much richer class of patterns involving exponentiation.…

Combinatorics · Mathematics 2016-10-24 Julian Sahasrabudhe

In this paper, we consider a subclass of quantum states in the multipartite system, namely, the supersymmetric states. We investigate the problem whether they admit the symmetrically separable decomposition, i.e., each term in this…

Quantum Physics · Physics 2019-01-23 Qian Lilong , Chu Delin

In this paper, we investigate the connection between infinite permutation monoids and bimorphism monoids of first-order structures. Taking our lead from the study of automorphism groups of structures as infinite permutation groups and the…

Group Theory · Mathematics 2019-02-12 Thomas D. H. Coleman , David M. Evans , Robert D. Gray

Given a quandle, we can construct a symmetric quandle called the symmetric double of the quandle. We show that the (co)homology groups of a given quandle are isomorphic to those of its symmetric double. Moreover, quandle coloring numbers…

Geometric Topology · Mathematics 2020-10-21 Kanako Oshiro

We study the existence of first integrals in nonholonomic systems with symmetry. First we define the concept of $\mathcal{M}$-cotangent lift of a vector field on a manifold $Q$ in order to unify the works [Balseiro P., Arch. Ration. Mech.…

Dynamical Systems · Mathematics 2016-02-23 Paula Balseiro , Nicola Sansonetto

Let $x:M^m\to \bar M$, with $m\geq 3$, be an isometric immersion of a complete noncompact manifold $M$ in a complete simply-connected manifold $\bar M$ with sectional curvature satisfying $-c^2\leq K_{\bar M}\leq 0$, for some constant $c$.…

Differential Geometry · Mathematics 2012-06-07 Marcos P. Cavalcante , Heudson Mirandola , Feliciano Vitorio

We give two extensions of the recent theorem of the first author that the odd distance graph has unbounded chromatic number. The first is that for any non-constant polynomial $f$ with integer coefficients and positive leading coefficient,…

Combinatorics · Mathematics 2024-05-24 James Davies , Rose McCarty , Michał Pilipczuk

In this paper we consider equimeasurable symmetric(rearrangement invariant) spaces $\mathbf{E}_1 = \mathbf{E}_1(\Omega_1,\mathcal{F}_1,\mu_1)$ and $\mathbf{E}_2 = \mathbf{E}_2(\Omega_2,\mathcal{F}_2,\mu_2)$ on a measure spaces $(\Omega_1,…

Functional Analysis · Mathematics 2020-06-30 Mustafa Muratov , Ben-Zion Rubshtein

Let $M$ be a sphere with handles and holes, $f:M\to\mathbb R^3$ an embedding, and $H_1=H_1(M;\mathbb Z)$. We study a simple isotopy invariant of $f$, the Seifert bilinear form $L(f):H_1\times H_1\to\mathbb Z$. Let $\cap:H_1\times…

Geometric Topology · Mathematics 2022-01-27 A. Skopenkov

Classical mathematics are founded within set theory, but sets don't have \emph{symmetries}. We conjecture that if we allow sets with symmetries, then many problems such as \emph{Mirror symmetry} or \emph{Homological mirror symmetry} can be…

Algebraic Topology · Mathematics 2014-07-09 Hugo V. Bacard

We say that a vertex or edge colouring of a graph is distinguishing if the only automorphism that preserves this colouring is the identity. A (proper) distinguishing colouring is irreducible if there is no possibility of merging two…

Combinatorics · Mathematics 2026-02-18 Marcin Stawiski

In this paper we consider the following question in the spirit of Ramsey theory: Given $x\in A^\omega,$ where $A$ is a finite non-empty set, does there exist a finite coloring of the non-empty factors of $x$ with the property that no…

Combinatorics · Mathematics 2014-03-26 Aldo de Luca , Elena V. Pribavkina , Luca Q. Zamboni

We investigate the structural relationship between prefix-free codes over the binary alphabet and a class of unlabeled rooted trees, which we call \emph{symmetric} trees. We establish a canonical correspondence between prefix-free codes and…

Information Theory · Computer Science 2026-03-31 Dean Kraizberg

We construct a compact closed category out of any symmetric monoidal category by freely adding adjoints to its objects. The morphisms of the completion are defined as string diagrams annotated by objects and morphisms from the original…

Category Theory · Mathematics 2022-01-24 Antonin Delpeuch

This paper provides two extensions of first order logic by `$\omega$-rules'. In each case we characterize the countable structures whose theory in the logic is categorical (has a unique model). In the one-sorted inferential $\omega$-logic,…

Logic · Mathematics 2026-04-28 John T. Baldwin , Constantin C. Brîncuş

The geometrical theory of partial differential equations in the absolute sense, without any additional structures, is developed. In particular the symmetries need not preserve the hierarchy of independent and dependent variables. The order…

Differential Geometry · Mathematics 2014-03-05 Veronika Chrastinová \and Václav Tryhuk

In this paper, we explore the interaction between two monoidal structures: a multiplicative one, for the encoding of pairing, and an additive one, for the encoding of choice. We propose a colored PROP to model computation in this framework,…

Logic in Computer Science · Computer Science 2025-05-21 Kostia Chardonnet , Marc de Visme , Benoît Valiron , Renaud Vilmart
‹ Prev 1 8 9 10 Next ›