The 15th International Conference on Concept Lattices and Their Applications CLA2020

Publications

?

The 15th International Conference on Concept Lattices and Their Applications CLA2020

Issue 2668. CEUR-WS, 2020.

Leading author: F. J. Valverde-Albacete

Proceedings of the Fifthteenth International Conference on Concept Lattices and Their Applications

Tallinn, Estonia, June 29–July 1, 2020.
Edited by

Francisco J. Valverde-Albacete
Martin Trnecka

Gradual Discovery with Closure Structure of a Concept Lattice

Kuznetsov S., Napoli A., Makhalova T., , in: The 15th International Conference on Concept Lattices and Their Applications CLA2020Issue 2668.: CEUR-WS, 2020. P. 145–157.

An approximate discovery of closed itemsets is usually based on either setting a frequency threshold or computing a sequence of projections. Both approaches, being incremental, do not provide any estimate of the size of the next output and do not ensure that “more interesting patterns” will be generated first. We propose to generate closed itemsets ...

Added: October 29, 2020

Towards Stable Significant Subgroup Discovery

Jyoti -., Buzmakov Aleksey, Kailasam S., , in: The 15th International Conference on Concept Lattices and Their Applications CLA2020Issue 2668.: CEUR-WS, 2020. P. 287–292.

Added: July 10, 2021

Priority areas: IT and mathematics business informatics mathematics

Language: English

Text on another site

Keywords: concept lattices

The 15th International Conference on Concept Lattices and Their Applications CLA2020

A Three-Party W-State Quantum Secret Sharing Protocol with X-Gate Encoding and Forbidden-Outcome Detection

Teregulov T., Loubenets E. R., / Series Quantum Physics "arXiv". 2026. No. 2609.31472.

We develop a new three-party quantum secret-sharing (QSS) protocol based on a three-qubit W state. This protocol encodes the secret-sequence bits using X gates and employs randomly selected Hadamard operations and measurement bases to generate information and security-test rounds. We evaluate the efficiency of the proposed protocol and analyze its security against an internal adversary ...

Added: September 28, 2026

Pairings on the algebra of Laurent series over a ring

Levashev V., / Series arXiv "math". 2026. No. 2609.06010.

We prove that continuous A-bilinear pairings on the ring of Laurent series that are invariant under continuous automorphisms coincide, up to a constant, with the pairing given by the residue of a differential form over any commutative associative ring with identity. ...

Added: September 24, 2026

Iterative construction of the R-matrices in arbitrary dimensions

Pyatov P. N., Pivovarov P. A., / Series math "arxiv.org". 2026. No. 2609.06274.

We investigate a special ansats that allows for an iterative solution of the constant Yang-Baxter equation. Testing this ansatz, we construct four sequences of the constant R-matrices. In each sequence the R-matrices act on the tensor squares of vector spaces of linearly growing dimensions. Each R-matrix also depends on a single complex parameter. By analyzing the ...

Added: September 24, 2026

On static manifolds with boundary admitting a nowhere-vanishing static potential

Medvedev V., / Series arXiv "math". 2026.

We study complete static manifolds with boundary admitting a nowhere-vanishing static potential. Our main result shows that, under a natural lower bound relating the scalar curvature and the boundary mean curvature, a simple static manifold with boundary must in fact have positive scalar curvature, negative boundary mean curvature, and be compact; we also obtain explicit ...

Added: September 19, 2026

Vague stimulating ideas, images and metaphors in scientific thinking: researchers' work with horizons of unclear knowledge

Poddiakov A., / Series Social Science Research Network "Social Science Research Network". 2026. No. 7437658.

Clarity of knowledge and reasoning is necessary in many cases. Yet vagueness in scientific thinking related to surprise, curiosity, "ability to engage with not-knowing" (de Freitas) and abductive reasoning is also a crucially important source of scientific creativity which supplements combinatorial logic when dealing with the already known. Starting from studies by C. S. Peirce ...

Added: September 15, 2026

On phase-lock area parquet in a special slow-fast limit of model of Josephson junction.

Glutsyuk A., / Series arXiv "math". 2026.

B.Josephson (Nobel Prize, 1973) predicted a tunnelling effect for a system of two superconductors separated by a narrow dielectric (such a system is called Josephson junction): existence of a supercurrent through it and equations governing it. The overdamped Josephson junction is modeled by the family of differential equations on the 2-torus, dθdτ=1ω(cosθ+B+Acosτ), which is known as ...

Added: September 8, 2026

Infinitely many graph manifolds with unique geometrical piece that admit arbitrarily many Anosov flows

Pochinka O., Shmukler V., / Series math.RT "arXiv:1808.06395 [math.RT]". 2026.

Anosov flows have a long and rich history, firstly motivated by the study of geodesic flows in negative curvature surface by Anosov and Sinai. Not every closed manifold admits an Anosov flow for well-known reasons: the fundamental group of a 3-manifold M admitting an Anosov flow must have exponential growth, and M must be universally covered by R3. Nevertheless, there ...

Added: August 31, 2026

On calibration of remote sensing retrievals of ecosystem respiration (Reco) with tower measurements over,Russian forests and wetlands

Shabanov N., Kuricheva O., Kurbatova J. et al., / Series Working Papers SSRN "Department of Economics Ca’ Foscari University of Venice". 2026.

The carbon balance of an ecosystem is the difference between Gross Primary Productivity (GPP) and Ecosystem Respiration (Reco) as expressed by Net Ecosystem Exchange (NEE). While remote sensing retrievals of GPP have reached maturity, Reco estimation remains underexplored and ultimately cast bias on NEE. Here we present an end-to-end multi-scale analysis of the mechanism of ...

Added: August 21, 2026

Three Algorithms for Merging Hierarchical Navigable Small World Graphs

Ponomarenko A., / Series Computer Science "arxiv.org". 2025.

This paper addresses the challenge of merging hierarchical navigable small world (HNSW) graphs, a critical operation for distributed systems, incremental indexing, and database compaction. We propose three algorithms for this task: Naive Graph Merge (NGM), Intra Graph Traversal Merge (IGTM), and Cross Graph Traversal Merge (CGTM). These algorithms differ in their approach to vertex selection ...

Added: July 30, 2026

New bound on S1× S2-setting Bell locality of a nonseparable Werner state

Loubenets E. R., / Series arxiv.org "quant-ph". 2026. No. 2607.18050.

In many quantum applications it is important to know whether or not a Bell nonlocal two-qudit state exhibits its nonlocality under correlation scenarios with some given numbers S1,S2≥1 of generalized quantum measurements at two sites. In the present article, we find analytically a new general locality condition sufficient for a nonseparable Werner state with a ...

Added: July 21, 2026

On functional equations for Chow polylogarithms

Bolbachan V., / Series math "arxiv.org". 2024.

Chow polylogarithms are some special functions arising in explicit description of the Beilinson regulator map. The most interesting functional equation for this function reflects its vanishing on the boundary in the Bloch's cycle complex. We show that this functional equation formally follows from more simple ones, namely skew-symmetry, functoriality and multiplicativity. To prove this, we study ...

Added: July 16, 2026

On Goncharov’s conjecture in next to Milnor degree

Bolbachan V., / Series math "arxiv.org". 2024.

Let K be a field of characteristic zero. We prove that its motivic cohomology in degree m−1 and weight m is rationally isomorphic to the cohomology of the polylogarithmic complex. This gives a partial extension of A. Suslin theorem describing the indecomposable K3 of a field. ...

Added: July 16, 2026

Statistical inference based on band-limited kernels: Rational-infinitely divisible distributions and beyond

Panov V., Ryabchenko A., / Series arXiv "stat.ME". 2026. No. 2607.05048.

This paper investigates the problem of statistical inference for a mixture distribution consisting of a discrete and a continuous component, with a particular focus on the class of rational-infinitely divisible distributions. We consider non-parametric estimation of both components of the mixture as well as the quasi-L{é}vy measure, assuming that the mixture belongs to the class ...

Added: July 9, 2026

Growth in noncommutative algebras and entropy in derived categories

Piontkovski D., / Series arXiv "math". 2026.

A noncommutative projective variety is defined, following Artin and Zhang, by a graded coherent algebra 𝐴. The category of coherent sheaves is then the quotient qgr(𝐴) of the category of finitely presented graded modules by the subcategory of torsion modules. We consider the categorical and polynomial entropies of the Serre twist, that is, of the ...

Added: June 23, 2026

Multilinear nilalgebras and the Jacobian theorem

Piontkovski D., / Series arXiv "math". 2025.

If a symmetric multilinear algebra is weakly nil, then it is Engel. This result may be regarded as an infinite-dimensional analogue of the well-known Jacobian theorem, which states that if a polynomial mapping has a polynomial inverse, then its Jacobian matrix is invertible. This refines a theorem of Gerstenhaber and partially answers a question posed ...

Added: June 23, 2026

Strong Approximations for Markov Chains Weakly Converging to Diffusions

Konakov V., Kucher D., Mammen E., / Series arXiv "math". 2026. No. 2606.11142v1.

In this paper, we construct strong approximations for discrete-time Markov chains weakly converging to continuous diffusion processes, as well as for their perturbed counterparts. Under the assumption of bounded coefficients, we construct closely coupled versions of these processes on a shared probability space. In particular, for both non-degenerate and degenerate cases, we maximize the probability ...

Added: June 11, 2026

Is Canfield Right? On the Asymptotic Coefficients for the Maximum Antichain of Partitions and Related Counting Inequalities

Ignatov D. I., , in: 11th International Conference, AIST 2023, Yerevan, Armenia, September 28–30, 2023, Revised Selected Papers. Analysis of Images, Social Networks and Texts. Lecture Notes in Computer Science (LNCS, volume 14486).: Cham: Springer, 2024. P. 349 – 361.

This paper dates back to the asymptotic solutions of Rota’s problem on the size of maximum antichain in the set partition lattice by Canfield and Harper and others. The knowledge of asymptotic coefficients could pave the way to the asymptotic solutions of such problems as (maximal) antichain counting in partition lattices. In addition to our ...

Added: January 23, 2026

Cooperative games with fuzzy characteristic functions on concept lattices

Kemgne M. W., Njionou B. B., Ignatov D. I. et al., International Journal of Approximate Reasoning 2025 Vol. 186 Article 109527

This paper introduces cooperative games with transferable utilities and fuzzy characteristic functions on concept lattices. While previous works have independently addressed games with fuzzy payoffs and games restricted to structured coalition systems such as lattices, our approach combines both perspectives. We consider cooperative settings where coalition formation is constrained by a concept lattice structure, and ...

Added: January 23, 2026

On syntactic concept lattice models for the Lambek calculus and infinitary action logic

Stepan L. Kuznetsov, Journal of Logic and Computation 2026 Vol. 36 No. 1 Article exaf078

The linguistic applications of the Lambek calculus suggest its semantics over algebras of formal languages. A straightforward approach to construct such semantics indeed yields a brilliant completeness theorem (Pentus 1995, Ann. Pure Appl. Logic, 75, 179–213). However, extending the calculus with extra operations ruins completeness. In order to mitigate this issue, Wurm (2017, J. Logic Lang. Inf., ...

Added: January 14, 2026

Syntactic concept lattice models for infinitary action logic

Stepan L. Kuznetsov, , in: Logic, Language, Information, and Computation: 30th International Workshop, WoLLIC 2024, Bern, Switzerland, June 10–13, 2024, ProceedingsVol. 14672: Lecture Notes in Computer Science.: Cham: Springer, 2024. P. 93–107.

Added: June 12, 2024

A Note on the Number of (Maximal) Antichains in the Lattice of Set Partitions

Ignatov D. I., , in: LNAI 14133: 28th International Conference on Conceptual Structures, ICCS 2023, Berlin, Germany, September 11–13, 2023, Proceedings. Graph-Based Representation and Reasoning.: Berlin: Springer, 2023. P. 56–69.

Set partitions and partition lattices are well-known objects in combinatorics and play an important role as a search space in many applied problems including ensemble clustering. Searching for antichains in such lattices is similar to that of in Boolean lattices. Counting the number of antichains in Boolean lattices is known as the Dedekind problem. In ...

Added: November 23, 2023

Decision Concept Lattice vs. Decision Trees and Random Forests

Dudyrev E., Kuznetsov S., , in: Formal Concept Analysis: 16th International Conference, ICFCA 2021, Strasbourg, France, June 29 – July 2, 2021, Proceedings.: Springer, 2021. Ch. 16 P. 252–260.

Added: September 28, 2021

Formal Concept Analysis: 16th International Conference, ICFCA 2021, Strasbourg, France, June 29 – July 2, 2021, Proceedings

Springer, 2021.

This book constitutes the proceedings of the 16th International Conference on Formal Concept Analysis, ICFCA 2021, held in Strasbourg, France, in June/July 2021. The 14 full papers and 5 short papers presented in this volume were carefully reviewed and selected from 32 submissions. The book also contains four invited contributions in full paper length. The research part ...

Added: July 10, 2021

Proceedings of the Fifthteenth International Conference on Concept Lattices and Their Applications

CEUR-WS.org, 2020.

The CLA conference is an international forum for researchers, practitioners and students dedicated to the practice of Formal Concept Analysis (FCA) and areas closely related to it, including data analysis and mining, information retrieval, knowledge management, knowledge engineering, logic, algebra and lattice theory. The 15th of CLA, CLA 2020, was going to be held in Tallinn, Estonia ...

Added: October 30, 2020