Related papers: On some new hook-content identities

We present in this work a complete session in a Mathematica notebook. The aim of this notebook is to check identities in symmetric compositions. This notebook is a complement of our work [1] and it has all the explicit computations. We…

In 2010, Vershik proposed a new combinatorial invariant of metric spaces given by a class of polytopes that arise in the theory of optimal transport and are called ``Wasserstein polytopes'' or ``Kantorovich-Rubinstein polytopes'' in the…

This purpose of this paper is to note an interesting identity derived from an integral in Gradshteyn and Ryzhik using techniques from George Boros'(deceased) Ph.D thesis. The idenity equates a sum to a product by evaluating an integral in…

Error-correcting codes and related combinatorial constructs play an important role in several recent (and old) results in computational complexity theory. In this paper we survey results on locally-testable and locally-decodable…

We present a collection of algorithms to filter a stream of documents in such a way that the filtered documents will cover as well as possible the interest of a person, keeping in mind that, at any given time, the offered documents should…

We present a new method for the derivation of convolution identities for finite sums of products of Bernoulli numbers. Our approach is motivated by the role of these identities in quantum field theory and string theory. We first show that…

De-identification is the task of detecting privacy-related entities in text, such as person names, emails and contact data. It has been well-studied within the medical domain. The need for de-identification technology is increasing, as…

Some new identities for Schur functions are proved. In particular, we settle in the affirmative a recent conjecture of Ishikawa-Wakayama and solve a problem raised by Bressoud.

Due to the rapid advancements of sensory and computing technology, multi-modal data sources that represent the same pattern or phenomenon have attracted growing attention. As a result, finding means to explore useful information from these…

In cyber-physical convergence scenarios information flows seamlessly between the physical and the cyber worlds. Here, users' mobile devices represent a natural bridge through which users process acquired information and perform actions. The…

Digital identity verification often forces a privacy trade-off, where users must disclose sensitive personal data to prove simple eligibility criteria. As blockchain applications integrate with regulated environments, this over-disclosure…

Universal identifiers and hashing have been widely adopted in computer science from distributed financial transactions to data science. This is a consequence of their capability to avoid many shortcomings of relative identifiers, such as…

Query answering routinely employs knowledge graphs to assist the user in the search process. Given a knowledge graph that represents entities and relationships among them, one aims at complementing the search with intuitive but effective…

This paper is on identification of classical information by the use of quantum channels. We focus on simultaneous ID codes which use measurements being useful to identify an arbitrary message. We give a direct and a converse part of the…

Cloth changing person re-identification(Re-ID) can work under more complicated scenarios with higher security than normal Re-ID and biometric techniques and is therefore extremely valuable in applications. Meanwhile, higher flexibility in…

In this paper, a class of combinatorial identities is proved. A method is used which is based on the following rule: counting elements of a given set in two ways and making equal the obtained results. This rule is known as "counting in two…

We develop a systematic approach to measuring combinatorial innovation in the biomedical sciences based upon the comprehensive ontology of Medical Subject Headings (MeSH). This approach leverages an expert-defined knowledge ontology that…

Historically, two complementary approaches to optical quantum information processing have been pursued: qubits and continuous-variables, each exploiting either particle or wave nature of light. However, both approaches have pros and cons.…

Some conjectures on partition hook lengths, recently stated by the author, have been proved and generalized by Stanley, who also needed a formula by Andrews, Goulden and Jackson on symmetric functions to complete his derivation. Another…

Large language models (LLMs) have recently advanced automatic heuristic design (AHD) for combinatorial optimization (CO), where candidate heuristics are iteratively proposed, evaluated, and refined. Most existing approaches search over…