English
Related papers

Related papers: Linear orderings of combinatorial cubes

200 papers

In various places in the literature it is stated that every separable linear order embeds into the real line. This is, however, not the case, at least not with respect to the usual definition of separability. We correct this misconception.

Logic · Mathematics 2016-06-02 Stefan Geschke

We establish a list of characterizations of bounded twin-width for hereditary, totally ordered binary structures. This has several consequences. First, it allows us to show that a (hereditary) class of matrices over a finite alphabet either…

Levine defined the rational algebraic knot concordance group and proved that each nontrivial element is of order two, of order four, or of infinite order. The determination of the order of an element depends on a p-adic analysis for all…

Geometric Topology · Mathematics 2013-09-30 Charles Livingston

The problem of efficiently characterizing degree sequences of simple hypergraphs is a fundamental long-standing open problem in Graph Theory. Several results are known for restricted versions of this problem. This paper adds to the list of…

Discrete Mathematics · Computer Science 2017-05-02 Syed Mohammad Meesum

Let $ R \subset \R $ be a GCD-domain. In this paper, Weinberg's conjecture on the $ n \times n $ matrix algebra $ M_{n}(R) \ (n \geq 2) $ is proved. Moreover, all the lattice orders (up to isomorphisms) on a full $ 2 \times 2 $ matrix…

Rings and Algebras · Mathematics 2014-07-02 Fei Li , Xianlong Bai , Derong Qiu

In this article we mainly study linear codes over $\mathbb{F}_{2^n}$ and their binary subfield codes. We construct linear codes over $\mathbb{F}_{2^n}$ whose defining sets are the certain subsets of $\mathbb{F}_{2^n}^m$ obtained from…

Information Theory · Computer Science 2023-03-17 Hongwei Liu , Zihao Yu

Let $C$ be a closed cone with nonempty interior $C^\circ$ in a Banach space. Let $f:C^\circ \rightarrow C^\circ$ be an order-preserving subhomogeneous function with a fixed point in $C^\circ$. We introduce a condition which guarantees that…

Functional Analysis · Mathematics 2022-08-16 Brian Lins

We determine the fixed locus of the anticanonical complete linear system of a given anticanonical rational surface. The case of a geometrically ruled rational surface is fully studied, e.g., the monoid of numerically effective divisor…

Algebraic Geometry · Mathematics 2012-01-25 Jesús Adrian Cerda Rodríguez , Gioia Failla , Mustapha Lahyane , Osvaldo Osuna Castro

We prove a conjecture of Dukes and Herke concerning the possible orders of a basis for the cyclic group Z_n, namely : For each k \in N there exists a constant c_k > 0 such that, for all n \in N, if A \subseteq Z_n is a basis of order…

Number Theory · Mathematics 2009-07-04 Peter Hegarty

An ordered hypergraph is a hypergraph whose vertex set is linearly ordered, and a convex geometric hypergraph is a hypergraph whose vertex set is cyclically ordered. Extremal problems for ordered and convex geometric graphs have a rich…

Combinatorics · Mathematics 2018-07-17 Zoltán Füredi , Tao Jiang , Alexandr Kostochka , Dhruv Mubayi , Jacques Verstraëte

We consider log-convex sequences that satisfy an additional constraint imposed on their rate of growth. We call such sequences log-balanced. It is shown that all such sequences satisfy a pair of double inequalities. Sufficient conditions…

Combinatorics · Mathematics 2007-05-23 Tomislav Došlić

We prove that for any sequence of binary alphabets $\mathcal{A}_1,\mathcal{A}_2,\dots$, there exists a cube-free word $c_1c_2\dots$ so that $c_1\in\mathcal{A}_1,c_2\in\mathcal{A}_2,\dots$. In particular, for every $n$, there are at least…

Combinatorics · Mathematics 2025-12-04 Vuong Bui , Matthieu Rosenfeld

Let $FG$ be the group algebra of a finite $p$-group $G$ over a finite field $F$ of positive characteristic $p$. Let $\cd$ be an involution of the algebra $FG$ which is a linear extension of an anti-automorphism of the group $G$ to $FG$. If…

Group Theory · Mathematics 2022-06-07 Zsolt Adam Balogh

We study preorders on (equivalence classes of) maximal chains in the general context of polygonal lattices endowed with suitably nice edge labellings. We show that, given a quotient of polygonal lattices, such edge labellings descend to the…

Combinatorics · Mathematics 2025-06-11 Mikhail Gorsky , Nicholas J. Williams

This article deals with the second order linear differential equations with entire coefficients. We prove some results involving conditions on coefficients so that the order of growth of every non-trivial solution is infinite.

Complex Variables · Mathematics 2021-02-24 Garima Pant , Manisha Saini

Let $A$ be a finite ordered set. Define the ordered set $A^A$ as the set of all maps from $A$ to $A$, ordered pointwise. Let ${}^{A} A$ be the dual of $A^A$. We prove results in the spirit of Parts~I--III, but now using both $A^A$ and…

Rings and Algebras · Mathematics 2025-10-02 G. Grätzer

Let $(x_n)_{n\geq0}$ be a linear recurrence of order $k\geq2$ satisfying $$x_n=a_1x_{n-1}+a_2x_{n-2}+\dots+a_kx_{n-k}$$ for all integers $n\geq k$, where $a_1,\dots,a_k,x_0,\dots, x_{k-1}\in \mathbb{Z},$ with $a_k\neq0$. In [`The quotient…

Number Theory · Mathematics 2022-11-22 Deepa Antony , Rupam Barman

A $k$-bisection of a bridgeless cubic graph $G$ is a $2$-colouring of its vertex set such that the colour classes have the same cardinality and all connected components in the two subgraphs induced by the colour classes (monochromatic…

Combinatorics · Mathematics 2018-09-11 Marien Abreu , Jan Goedgebeur , Domenico Labbate , Giuseppe Mazzuoccolo

We give a notably simpler and shorter proof of H. B. Neumann's result which is stated, cursorly, like this. For any well-ordered subset, A, of a totally ordered semigroup, the set of products of any finite number of elements of A is itself…

Combinatorics · Mathematics 2022-03-03 Labib Haddad

A run in a string is a maximal periodic substring. For example, the string $\texttt{bananatree}$ contains the runs $\texttt{anana} = (\texttt{an})^{3/2}$ and $\texttt{ee} = \texttt{e}^2$. There are less than $n$ runs in any length-$n$…

Data Structures and Algorithms · Computer Science 2021-02-18 Jonas Ellert , Johannes Fischer