惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

美团技术团队
T
The Blog of Author Tim Ferriss
月光博客
月光博客
阮一峰的网络日志
阮一峰的网络日志
Engineering at Meta
Engineering at Meta
量子位
I
InfoQ
Jina AI
Jina AI
Microsoft Security Blog
Microsoft Security Blog
H
Help Net Security
H
Hackread – Cybersecurity News, Data Breaches, AI and More
G
Google Developers Blog
J
Java Code Geeks
Recent Announcements
Recent Announcements
aimingoo的专栏
aimingoo的专栏
小众软件
小众软件
V
V2EX
腾讯CDC
P
Proofpoint News Feed
A
About on SuperTechFans
爱范儿
爱范儿
U
Unit 42
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
Last Week in AI
Last Week in AI

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Some further applications of a lattice theoretic method i...
Mika Mattila, Pentti Haukkanen, Jori Mäntysalo · 2022-12-15 · via math.CO updates on arXiv.org

In 1876 H. J. S. Smith defined an LCM matrix as follows: let S = {x_1, x_2, ..., x_n} be a set of positive integers. The LCM matrix [S] is the n $\times$ n matrix with lcm(x_i , x_j) as its ij entry. During the last 30 years singularity of LCM matrices has interested many authors. In 1992 Bourque and Ligh ended up conjecturing that if the GCD closedness of the set S (which means that gcd(x_i, x_j) $\in$ S for all i, j $\in$ {1, 2, . . . , n}), suffices to guarantee the invertibility of the matrix [S]. However, a few years later this conjecture was proven false first by Haukkanen et al. and then by Hong. It turned out that the conjecture holds only on GCD closed sets with at most 7 elements but not in general for larger sets. However, the given counterexamples did not give much insight on why does the conjecture fail exactly in the case when n=8. This situation was later improved in a couple of articles, where a new lattice theoretic approach was introduced (the method is based on the fact that because the set S is assumed to be GCD closed, the structure (S, |) actually forms a meet semilattice). For example, it has been shown that in the case when the set S has 8 elements and the matrix [S] is singular, there is only one option for the semilattice structure of (S, |), namely the cube structure. Since the cases up to n=8 have been thoroughly studied in various articles, the next natural step is to apply the methods to the case n=9. This was done by Altinisik and Altintaa as they consider the different lattice structures of (S, |) with nine elements that can result in a singular LCM matrix [S]. However, their investigation leaves two open questions, and the main purpose of this presentation is to provide solutions to them. We shall also give a new lattice theoretic proof for a result referred to as Sun's conjecture, which was originally proven by Hong via number theoretic approach.