中文
相关论文

相关论文: Dimension of RC-lattices

200 篇论文

If the number of runs in a (mixed-level) orthogonal array of strength 2 is specified, what numbers of levels and factors are possible? The collection of possible sets of parameters for orthogonal arrays with N runs has a natural lattice…

组合数学 · 数学 2014-11-18 E. M. Rains , N. J. A. Sloane , John Stufken

We investigate the lattice L(V) of subspaces of an m-dimensional vector space V over a finite field GF(q) with q being the n-th power of a prime p. It is well-known that this lattice is modular and that orthogonality is an antitone…

环与代数 · 数学 2020-02-04 Ivan Chajda , Helmut Länger

We consider the problem of finding lower bounds on the number of unlabeled $n$-element lattices in some lattice family. We show that if the family is closed under vertical sum, exponential lower bounds can be obtained from vertical sums of…

组合数学 · 数学 2019-02-26 Jukka Kohonen

The fixed point property for finite posets of width 3 and 4 is studied in terms of forbidden retracts. The ranked forbidden retracts for width 3 and 4 are determined explicitly. The ranked forbidden retracts for the width 3 case that are…

组合数学 · 数学 2007-05-23 Jonathan David Farley

We give two sufficient conditions for the lattice Co(R^n,X) of relatively convex sets of n-dimensional real space R^n to be join-semidistributive, where X is a finite union of segments. We also prove that every finite lower bounded lattice…

环与代数 · 数学 2011-06-15 K. Adaricheva

Let $L$ be a distributive lattice and $R(L)$ the associated Hibi ring. We compute $\reg R(L)$ when $L$ is a planar lattice and give a lower bound for $\reg R(L)$ when $L$ is non-planar, in terms of the combinatorial data of $L.$ As a…

交换代数 · 数学 2013-07-31 Viviana Ene , Ayesha Asloob Qureshi , Asia Rauf

We find tight estimates for the minimum number of proper subspaces needed to cover all lattice points in an n-dimensional convex body symmetric about the origin. We also find the order of magnitude of the number of (n-1)-dimensional…

数论 · 数学 2024-11-18 Imre Bárány , Gergely Harcos , János Pach , Gábor Tardos

A lattice is a set of all the integer linear combinations of certain linearly independent vectors. One of the most important concepts on lattice is the successive minima which is of vital importance from both theoretical and practical…

信息论 · 计算机科学 2018-05-16 Jinming Wen

We study a generalization of additive bases into a planar setting. A planar additive basis is a set of non-negative integer pairs whose vector sumset covers a given rectangle. Such bases find applications in active sensor arrays used in,…

数论 · 数学 2018-12-19 Jukka Kohonen , Visa Koivunen , Robin Rajamäki

We prove that of all two-dimensional lattices of covolume 1 the hexagonal lattice has asymptotically the fewest distances. An analogous result for dimensions 3 to 8 was proved in 1991 by Conway and Sloane. Moreover, we give a survey of some…

数论 · 数学 2008-02-01 Pieter Moree , Robert Osburn

Problems related to projections on closed convex cones are frequently encountered in optimization theory and related fields. To study these problems, various unifying ideas have been introduced, including asymmetric vector-valued norms and…

最优化与控制 · 数学 2022-04-11 Jani Jokela

We characterize numerical semigroups for which the poset of its ideal class monoid is a lattice, and study the irreducible elements of such a lattice with respect to union, intersection, infimum and supremum.

交换代数 · 数学 2024-12-11 S. Bonzio , P. A. García-Sánchez

A Banaschewski function on a bounded lattice L is an antitone self-map of L that picks a complement for each element of L. We prove a set of results that include the following: (1) Every countable complemented modular lattice has a…

环与代数 · 数学 2009-06-05 Friedrich Wehrung

As the main achievement of the paper, we construct a three-generated, 2-distributive, atomless lattice that is not finitely presented. Also, the paper contains the following three observations. First, every coatomless three-generated…

环与代数 · 数学 2020-08-04 Gábor Czédli

Let $L$ be a slim, planar, semimodular lattice (slim means that it does not contain ${\mathsf M}_3$-sublattices). We call the interval $I = [o, i]$ of $L$ \emph{rectangular}, if there are $u_l, u_r \in [o, i] - \{o,i\}$ such that $o = u_l…

环与代数 · 数学 2022-05-24 G. Grätzer

For a rank two root system and a pair of nonnegative integers, using only elementary combinatorics we construct two posets. The constructions are uniform across the root systems A1+A1, A2, C2, and G2. Examples appear in Figures 3.2 and 3.3.…

Non-rigidity degree of a lattice $L$, nrd$L$, is dimension of the L-type domain to which $L$ belongs. We complete here the table of nrd's of all root lattices and their duals; namely, the hardest remaining case of $D_n^*$, and the case of…

几何拓扑 · 数学 2007-05-23 Michel Deza , Viacheslav Grishukhin

This paper is the English translation of the first 4 sections of the article ``Dimension de Heitmann des treillis distributifs et des anneaux commutatifs. Publications Math\'ematiques de Besan\c{c}on. Alg\`ebre et th\'eorie des nombres,…

交换代数 · 数学 2025-10-13 Thierry Coquand , Henri Lombardi , Claude Quitté

The cross--product conjecture (CPC) of Brightwell, Felsner and Trotter (1995) is a two-parameter quadratic inequality for the number of linear extensions of a poset $P= (X, \prec)$ with given value differences on three distinct elements in…

组合数学 · 数学 2022-12-05 Swee Hong Chan , Igor Pak , Greta Panova

We study the projectivity of the free Banach lattice generated by a lattice $\mathbb{L}$ in two cases: when the lattice is finite, and when the lattice is an infinite linearly ordered set. We prove that in the first case it is projective…

泛函分析 · 数学 2021-02-23 Antonio Avilés , José David Rodríguez Abellán