Related papers: A General Framework for Low Soundness Homomorphism…
We study codes with a single check element derived from group rings, namely, checkable codes. The notion of a code-checkable group ring is introduced. Necessary and sufficient conditions for a group ring to be code-checkable are given in…
We study word maps with constants on symmetric groups. Even though there are mixed identities of bounded length that are valid for all symmetric groups, we show that no such identities hold in a metric sense. Moreover, we prove that word…
The rapid development of derandomization theory, which is a fundamental area in theoretical computer science, has recently led to many surprising applications outside its initial intention. We will review some recent such developments…
A quasihomomorphism is a map that satisfies the homomorphism relation up to bounded error. Fujiwara and Kapovich proved a rigidity result for quasihomomorphisms taking values in discrete groups, showing that all quasihomomorphisms can be…
Calculating and categorizing the similarity of curves is a fundamental problem which has generated much recent interest. However, to date there are no implementations of these algorithms for curves on surfaces with provable guarantees on…
Consider the problem of testing whether the outputs of a large language model (LLM) system change under an arbitrary intervention, such as an input perturbation or changing the model variant. We cannot simply compare two LLM outputs since…
A group is coherent if all its finitely generated subgroups are finitely presented. In this article we provide a criterion for positively determining the coherence of a group. This criterion is based upon the notion of the perimeter of a…
We relate the computational complexity of finite strings to universal representations of their underlying symmetries. First, Boolean functions are classified using the universal covering topologies of the circuits which enumerate them. A…
We present a simple and versatile framework for evaluating ranked lists in terms of group fairness and relevance, where the groups (i.e., possible attribute values) can be either nominal or ordinal in nature. First, we demonstrate that, if…
We study the semicontinuity of automorphism groups for perturbations of domains in complex space or in complex manifolds. We provide a new approach to the study of such results for domains having minimal boundary smoothness. The emphasis in…
Selecting hyperparameters for unsupervised learning problems is challenging in general due to the lack of ground truth for validation. Despite the prevalence of this issue in statistics and machine learning, especially in clustering…
Let $M$ be the circle or a compact interval, and let $\alpha=k+\tau\ge1$ be a real number such that $k=\lfloor \alpha\rfloor$. We write $\mathrm{Diff}_+^{\alpha}(M)$ for the group of $C^k$ diffeomorphisms of $M$ whose $k^{th}$ derivatives…
In this work, we answer the homotopy invariance question for the ''smallest'' non-isotrivial group-scheme over $\mathbb{P}^1$, obtaining a result, which is not contained in previous works due to Knudson and Wendt. More explicitly, let…
This paper studies the limitations of the generic approaches to solving cryptographic problems in classical and quantum settings in various models. - In the classical generic group model (GGM), we find simple alternative proofs for the…
The standard empirical risk minimization (ERM) can underperform on certain minority groups (i.e., waterbirds in lands or landbirds in water) due to the spurious correlation between the input and its label. Several studies have improved the…
Biclustering is a method for detecting homogeneous submatrices in a given observed matrix, and it is an effective tool for relational data analysis. Although there are many studies that estimate the underlying bicluster structure of a…
The intention of this thesis is to provide general tools and concepts that allow to perform a mathematically substantiated symmetry reduction in (quantum) gauge field theories. Here, the main focus is on the framework of loop quantum…
It is well-known that if we gauge a $\mathbb{Z}_n$ symmetry in two dimensions, a dual $\mathbb{Z}_n$ symmetry appears, such that re-gauging this dual $\mathbb{Z}_n$ symmetry leads back to the original theory. We describe how this can be…
We consider the problem of testing whether an unknown Boolean function $f$ is monotone versus $\epsilon$-far from every monotone function. The two main results of this paper are a new lower bound and a new algorithm for this well-studied…
It is, by now, classical that lattices in higher rank semisimple groups have various rigidity properties. In this work, we add another such rigidity property to the list: uniform stability with respect to the family of unitary operators on…