Results 41 to 50 of about 538 (171)
Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices [PDF]
, 2011 The Border algorithm and the iPred algorithm find the Hasse diagrams of FCA lattices. We show that they can be generalized to arbitrary lattices. In the case of iPred, this requires the identification of a join-semilattice homomorphism into a distributive lattice.
José L. Balcázar, Cristina Tîrnauca
openaire +3 more sources
Research on partial order set evaluation of financial performance of Baijiu enterprises: An empirical analysis based on Luzhou Laojiao [PDF]
Zhongguo niangzaoAiming at the financial performance evaluation of Baijiu enterprises, selecting Luzhou Laojiao Co., Ltd. as the main research object and 16 listed Baijiu companies as samples, the financial performance evaluation index system of Baijiu enterprises was ...
LI Mingyu, HE Mengyao
doaj +1 more source
On exotic matrix exponential sums and Bessel–Speh functions
Journal of the London Mathematical Society, Volume 114, Issue 1, July 2026.Abstract In a previous work with Carmon, we defined Bessel–Speh functions. These are matrix coefficients of irreducible Speh representations of GLkc(F)$\mathrm{GL}_{kc}(\mathbb {F})$, where F$\mathbb {F}$ is a finite field. They arise from (k,c)$(k,c)$ models, which are models that generalize the Whittaker model to Speh representations attached to ...
Elad Zelingher
wiley +1 more source
A Cognitively-Inspired Model for Making Sense of Hasse Diagrams [PDF]
, 2021 In this paper, we present a model of the sense-making process for diagrams, and describe it for the case of Hasse diagrams. Sense-making is modeled as the construction of networks of conceptual blends among image schemas and the diagram’s geometric configuration.
Dimitra Bourou +2 more
openaire +1 more source
Gluing posets and the dichotomy of poset saturation numbers
Mathematika, Volume 72, Issue 3, July 2026.Abstract Given a finite poset P$\mathcal {P}$, we say that a family F$\mathcal {F}$ of subsets of [n]$[n]$ is P$\mathcal {P}$‐saturated if F$\mathcal {F}$ does not contain an induced copy of P$\mathcal {P}$, but adding any other set to F$\mathcal {F}$ creates an induced copy of P$\mathcal {P}$.
Maria‐Romina Ivan, Sean Jaffe
wiley +1 more source
Journal of Chemometrics, Volume 40, Issue 6, June 2026.ABSTRACT ANOVA simultaneous component analysis (ASCA) is the current state‐of‐the‐art chemometric tool for analyzing and interpreting high‐dimensional experimental data from a design of experiments (DoE). Being a multivariate extension of the ANOVA, ASCA makes a perfect tandem with DoE.
José Camacho +3 more
wiley +1 more source
Finding Minimum‐Cost Explanations for Predictions Made by Tree Ensembles
Software: Practice and Experience, Volume 56, Issue 6, Page 615-642, June 2026.ABSTRACT The ability to reliably explain why a machine learning model arrives at a particular prediction is crucial when used as decision support by human operators of critical systems. The provided explanations must be provably correct, and preferably without redundant information, called minimal explanations.
John Törnblom +2 more
wiley +1 more source
On the number of realizations of a Hasse diagram by finite sets [PDF]
Proceedings of the American Mathematical Society, 1955 R. Dedekind proposed the problem, still unsolved for n>6, of finding the order f(n) of the free distributive lattice with n generators.' It is known that f(n) is the number of families F of subsets of a set of n objects such that no subset in F includes any other.2 A closely related problem is that of finding the number of families of subsets having ...
openaire +1 more source
Set-theoretical and Combinatorial Instruments for Problem Space Analysis in Adaptive Serious Games
International Journal of Serious Games, 2018 The Computerized Adaptive Practice (CAP) system describes a set of algorithms for assessing player’s expertise and difficulties of in-game problems and for adapting the latter to the former. However, an effective use of CAP requires that in-game problems
Enkhbold Nyamsuren +2 more
doaj +1 more source
A categorification of combinatorial Auslander–Reiten quivers
Journal of the London Mathematical Society, Volume 113, Issue 5, May 2026.Abstract We provide a categorification of Oh and Suh's combinatorial Auslander–Reiten quivers in the simply laced case. We work within the perfectly valued derived category pvd(ΠQ)$\mathrm{pvd}(\Pi _Q)$ of the 2‐dimensional Ginzburg dg algebra of a Dynkin quiver Q$Q$.
Ricardo Canesin
wiley +1 more source