相关论文: Equivalence Classes in AES -- Part 1

The theory of matchgates is of interest in various areas in physics and computer science. Matchgates occur in e.g. the study of fermions and spin chains, in the theory of holographic algorithms and in several recent works in quantum…

We consider two families of equivalence classes in the Weyl groups of type $B_n$ which are suggested by the study of left cells in unequal parameter Iwahori-Hecke algebras. Both families are indexed by a non-negative integer $r$. For $r=0$,…

We consider any fixed $d\in\mathbb{Z}_{>0}$ number of second class particles in the asymmetric simple exclusion process (ASEP), constructed via a basic coupling of two ASEPs. We give the joint distribution of the positions of the second…

In this paper we study the approximate learnability of valuations commonly used throughout economics and game theory for the quantitative encoding of agent preferences. We provide upper and lower bounds regarding the learnability of…

Every partial function from bit strings of a given length to bit strings of a possibly different given length can be computed by a finite instruction sequence that contains only instructions to set and get the content of Boolean registers,…

One common loss function in neural network classification tasks is Categorical Cross Entropy (CCE), which punishes all misclassifications equally. However, classes often have an inherent structure. For instance, classifying an image of a…

Backdoor learning has become an emerging research area towards building a trustworthy machine learning system. While a lot of works have studied the hidden danger of backdoor attacks in image or text classification, there is a limited…

Parity (XOR) classification requires detecting discrete, high-order feature interactions that smooth classical kernels cannot efficiently capture. We study how quantum kernel advantage depends on parity complexity, the number of features…

We consider the problem of allocating $m$ indivisible chores to $n$ agents with additive disvaluation (cost) functions. It is easy to show that there are picking sequences that give every agent (that uses the greedy picking strategy) a…

Some techniques for the use of bitwise operations are described in the article. As an example, an open problem of isomorphism-free generations of combinatorial objects is discussed. An equivalence relation on the set of square binary…

Given a text and a pattern over an alphabet, the pattern matching problem searches for all occurrences of the pattern in the text. An equivalence relation $\approx$ is called a substring consistent equivalence relation (SCER), if for two…

For a given extension $A \subset E$ of associative algebras we describe and classify up to an isomorphism all $A$-complements of $E$, i.e. all subalgebras $X$ of $E$ such that $E = A + X$ and $A \cap X = \{0\}$. Let $X$ be a given…

We put forward an alternative approach to the SLOCC classification of entanglement states of three-qubit and four-qubit systems. By directly solving matrix equations, we obtain the relations satisfied by the amplitudes of states. The…

The notions of equivalence and strict equivalence for order one differential equations are introduced. The more explicit notion of strict equivalence is applied to examples and questions concerning autonomous equations and equations having…

In the classification of real singularities by Arnold et al. (1985), normal forms, as representatives of equivalence classes under right equivalence, are not always uniquely determined. We describe the complete structure of the equivalence…

Mixture-of-Experts architectures have become the standard for scaling large language models due to their superior parameter efficiency. To accommodate the growing number of experts in practice, modern inference systems commonly adopt expert…

Mixture-of-Experts (MoE) models deliver high quality at low training FLOPs, but this efficiency often vanishes at inference. We identify a double penalty that structurally disadvantages MoE architectures during decoding: first, expert…

Almost difference sets have emerged as a fascinating and important area of research as they can produce functions with optimal nonlinearity, cyclic codes, and binary sequences with optimal autocorrelation. This study aims to investigate the…

Let A and B be normal matrices with coefficients that are continuous complex-valued functions on a topological space X that has the homotopy type of a CW complex, and suppose these matrices have the same distinct eigenvalues at each point…

Leveraging an equivalence property in the state-space of a Markov Decision Process (MDP) has been investigated in several studies. This paper studies equivalence structure in the reinforcement learning (RL) setup, where transition…