中文
相关论文

相关论文: On The Relational Width of First-Order Expansions …

200 篇论文

Solving the algebraic dichotomy conjecture for constraint satisfaction problems over structures first-order definable in countably infinite finitely bounded homogeneous structures requires understanding the applicability of…

计算机科学中的逻辑 · 计算机科学 2020-01-22 Michał Wrona

A structure is called homogeneous if every isomorphism between finite substructures of the structure extends to an automorphism of the structure. Recently, P. J. Cameron and J. Ne\v{s}et\v{r}il introduced a relaxed version of homogeneity:…

组合数学 · 数学 2010-01-06 Dragan Mašulović , Rajko Nenadov , Nemanja Škorić

A partial order is called semilinear iff the upper bounds of each element are linearly ordered and any two elements have a common upper bound. There exists, up to isomorphism, a unique countable existentially closed semilinear order, which…

A structure is called homogeneous if every isomorphism between finitely induced substructures of the structure extends to an automorphism of the structure. Recently, P. J. Cameron and J. Ne\v{s}et\v{r}il introduced a relaxed version of…

组合数学 · 数学 2009-12-31 Dragan Mašulović , Rajko Nenadov , Nemanja Škorić

An infinite structure has the finite length property (over a given field) if, for each of its finite powers, chains of equivariant subspaces in the corresponding free vector space are bounded in length. Prior work showed that the countable…

组合数学 · 数学 2026-05-22 Jingjie Yang , Mikołaj Bojańczyk , Bartek Klin

In this article, we study "questionable representations" of (partial or total) orders, introduced in our previous article "A class of orders with linear? time sorting algorithm". (Later, we consider arbitrary binary functional/relational…

组合数学 · 数学 2020-02-24 Laurent Lyaudet

We give an unexpectedly simple presentation of the maximal prolongation of a first-order differential calculus in terms of the bimodule map of a torsion-free bimodule connection. We then show that in the quantum homogeneous space case this…

We obtain upper bounds on the composition length of a finite permutation group in terms of the degree and the number of orbits, and analogous bounds for primitive, quasiprimitive and semiprimitive groups. Similarly, we obtain upper bounds…

群论 · 数学 2018-03-15 S. P. Glasby , Cheryl E. Praeger , Kyle Rosa , Gabriel Verret

We relate the maximum semidefinite and linear extension complexity of a family of polytopes to the cardinality of this family and the minimum pairwise Hausdorff distance of its members. This result directly implies a known lower bound on…

最优化与控制 · 数学 2016-05-30 Gennadiy Averkov , Volker Kaibel , Stefan Weltge

We study the structure of the language of binary cube-free words. Namely, we are interested in the cube-free words that cannot be infinitely extended preserving cube-freeness. We show the existence of such words with arbitrarily long finite…

形式语言与自动机理论 · 计算机科学 2011-08-19 Elena A. Petrova , Arseny M. Shur

A relational structure R is ultrahomogeneous if every isomorphism of finite induced substructures of R extends to an automorphism of R. We classify the ultrahomogeneous finite binary relational structures with one asymmetric binary relation…

组合数学 · 数学 2024-08-15 Irene Heinrich , Eda Kaja , Pascal Schweitzer

We extend some of our earlier results on the interconnection between ultrafilter extensions, and ultrapowers. Throughout we restrict ourselves to relational structures with one binary relation. Recently it was shown that for bounded…

逻辑 · 数学 2025-02-25 Zalán Molnár

Brauer and Thrall conjectured that a finite-dimensional algebra over a field of bounded representation type is actually of finite representation type and a finite-dimensional algebra (over an infinite field) of infinite representation type…

表示论 · 数学 2018-05-25 Fahimeh Sadat Fotouhi , Alex Martsinkovsky , Shokrollah Salarian

We prove that relational structures admitting specific polymorphisms (namely, canonical pseudo-WNU operations of all arities $n \geq 3$) have low relational width. This implies a collapse of the bounded width hierarchy for numerous classes…

计算机科学中的逻辑 · 计算机科学 2024-07-17 Antoine Mottet , Tomáš Nagy , Michael Pinsker , Michał Wrona

The notion of bounded expansion captures uniform sparsity of graph classes and renders various algorithmic problems that are hard in general tractable. In particular, the model-checking problem for first-order logic is fixed-parameter…

We describe simple algebraic and combinatorial characterisations of finite relational core structures admitting finitely many obstructions. As a consequence, we show that it is decidable to determine whether a constraint satisfaction…

计算机科学中的逻辑 · 计算机科学 2015-07-01 Benoit Larose , Cynthia Loten , Claude Tardif

We continue developing the theory around the twin-width of totally ordered binary structures, initiated in the previous paper of the series. We first introduce the notion of parity and linear minors of a matrix, which consists of…

数据结构与算法 · 计算机科学 2022-09-27 Édouard Bonnet , Ugo Giocanti , Patrice Ossona de Mendez , Stéphan Thomassé

We provide a doubly exponential upper bound in $p$ on the size of forbidden pivot-minors for symmetric or skew-symmetric matrices over a fixed finite field $\mathbb{F}$ of linear rank-width at most $p$. As a corollary, we obtain a doubly…

组合数学 · 数学 2014-12-24 Mamadou Moustapha Kanté , O-joung Kwon

Let $S$ be a set of $n$ points in $\mathbb{R}^d$, where $d \geq 2$ is a constant, and let $H_1,H_2,\ldots,H_{m+1}$ be a sequence of vertical hyperplanes that are sorted by their first coordinates, such that exactly $n/m$ points of $S$ are…

Let $\mathcal{W}(b)$ be a class of free Lie conformal algebras of rank $2$ with $\mathbb{C}[\partial]$-basis ${L,H}$ and relations \begin{eqnarray*} [L_\lambda L]=(\partial+2\lambda)L,\ \ [L_\lambda H]=\big(\partial+(1-b)\lambda\big)H, \ \…

环与代数 · 数学 2018-09-14 Kaijing Ling , Lamei Yuan
‹ 上一页 1 2 3 10 下一页 ›