Related papers: Quantitative aspects of linear and affine closed l…
A decision list is an ordered list of rules. Each rule is specified by a term, which is a conjunction of literals, and a value. Given an input, the output of a decision list is the value corresponding to the first rule whose term is…
Complex classifiers may exhibit "embarassing" failures in cases where humans can easily provide a justified classification. Avoiding such failures is obviously of key importance. In this work, we focus on one such setting, where a label is…
We study criteria for deciding when the normal subgroup generated by a single polynomial automorphism of $\mathbb{A}^n$ is as large as possible, namely equal to the normal closure of the special linear group in the special automorphism…
Factor analysis refers to a statistical model in which observed variables are conditionally independent given fewer hidden variables, known as factors, and all the random variables follow a multivariate normal distribution. The parameter…
We prove a sharp bound for the remainder term of the number of lattice points inside a ball, when averaging over a compact set of (not necessarily unimodular) lattices, in dimensions two and three. We also prove that such a bound cannot…
A new class of two-level non-regular fractional factorial designs is defined. We call this class an {\it affinely full-dimensional factorial design}, meaning that design points in the design of this class are not contained in any affine…
For any increasing function $f: {\Bbb N} \rightarrow {\Bbb N}_{\ge 2}$ which takes only finitely many distinct values, a connected finite dimensional algebra $\Lambda$ is constructed, with the property that $\text{fin.dim}_n\, \Lambda =…
We present a new application of affine Lie algebras to massive quantum field theory in 2 dimensions, by investigating the $q\to 1$ limit of the q-deformed affine $\hat{sl(2)}$ symmetry of the sine-Gordon theory, this limit occurring at the…
We introduce a system of monadic affine sized types, which substantially generalise usual sized types, and allows this way to capture probabilistic higher-order programs which terminate almost surely. Going beyond plain, strong…
For the last two decades, high-dimensional data and methods have proliferated throughout the literature. Yet, the classical technique of linear regression has not lost its usefulness in applications. In fact, many high-dimensional…
We investigate the internal behavior of Transformer-based Large Language Models (LLMs) when they generate factually incorrect text. We propose modeling factual queries as constraint satisfaction problems and use this framework to…
In this paper, we give new criteria for affineness of a variety defined over $\Bbb{C}$. Our main result is that an irreducible algebraic variety $Y$ (may be singular) of dimension $d$ ($d\geq 1$) defined over $\Bbb{C}$ is an affine variety…
The clone of term operations of an algebraic structure consists of all operations that can be expressed by a term in the language of the structure. We consider bounds for the length and the height of the terms expressing these functions,…
The linear optimization degree gives an algebraic measure of complexity of optimizing a linear objective function over an algebraic model. Geometrically, it can be interpreted as the degree of a projection map on the {affine} conormal…
The asymptotic study of the conjugacy classes of a random element of the finite affine group leads one to define a probability measure on the set of all partitions of all positive integers. Four different probabilistic understandings of…
We exhibit an algorithm to compute the strongest polynomial (or algebraic) invariants that hold at each location of a given affine program (i.e., a program having only non-deterministic (as opposed to conditional) branching and all of whose…
Binary matrix codes with restricted row and column weights are a desirable method of coded modulation for power line communication. In this work, we construct such matrix codes that are obtained as products of affine codes - cosets of…
Single-tape nondeterministic Turing machines that are allowed to replace the symbol in each tape cell only when it is scanned for the first time are also known as 1-limited automata. These devices characterize, exactly as finite automata,…
Automorphisms of finite order and real forms of "smooth" affine Kac-Moody algebras are studied, i.e. of 2-dimensional extensions of the algebra of smooth loops in a simple Lie algebra. It is shown that they can be parametrized by certain…
General error locator polynomials are polynomials able to decode any correctable syndrome for a given linear code. Such polynomials are known to exist for all cyclic codes and for a large class of linear codes. We provide some decoding…