Related papers: Quantitative aspects of linear and affine closed l…

We investigate a class of nominal algebraic Henkin-style models for the simply typed lambda-calculus in which variables map to names in the denotation and lambda-abstraction maps to a (non-functional) name-abstraction operation. The…

The complexity of continuous piecewise affine (CPA) functions can be measured by the number of pieces $p$ or the number of distinct affine functions $n$. For CPA functions on $\mathbb{R}^d$, this paper shows an upper bound of $p=O(n^{d+1})$…

We study the approximability of Max Ones when the number of variable occurrences is bounded by a constant. For conservative constraint languages (i.e., when the unary relations are included) we give a complete classification when the number…

For linear recurrence systems, the problem of finding rational solutions is reduced to the problem of computing polynomial solutions by computing a content bound or a denominator bound. There are several bounds in the literature. The…

Let Z be an affine algebraic variety and ED(Z)= max(2 dim Z+1, dim TZ). Let X be a smooth algebraic variety isomorphic to a semi-simple linear algebraic group whose Lie algebra is a sum of special linear Lie algebras. We show that if dim X…

In this note, we establish the convexity and monotonicity for affine standard Lyndon words in all types, generalizing the $A$-type results of arXiv:2305.16299. We also derive partial results on the structure of imaginary standard Lyndon…

Classification of Non-linear Boolean functions is a long-standing problem in the area of theoretical computer science. In this paper, effort has been made to achieve a systematic classification of all n-variable Boolean functions, where…

We introduce a quantum-like classical computational model, called affine computation, as a generalization of probabilistic computation. After giving the basics of affine computation, we define affine finite automata (AfA) and compare it…

Many domain experts do not have the time or expertise to write formal Bayesian models. This paper takes an informal problem description as input, and combines a large language model and a probabilistic programming language to define a joint…

An integral quadratic form is called strictly $n$-regular if it primitively represents all quadratic forms in $n$ variables that are primitively represented by its genus. For any $n \geq 2$, it will be shown that there are only finitely…

A linear inference is a valid inequality of Boolean algebra in which each variable occurs at most once on each side. In this work we leverage recently developed graphical representations of linear formulae to build an implementation that is…

Let A be a finite set of integers. For a polynomial f(x_1,...,x_n) with integer coefficients, let f(A) = {f(a_1,...,a_n) : a_1,...,a_n \in A}. In this paper it is proved that for every pair of normalized binary linear forms f(x,y)=u_1x+v_1y…

We randomly construct various subsets $\Lambda$ of the integers which have both smallness and largeness properties. They are small since they are very close, in various meanings, to Sidon sets: the continuous functions with spectrum in…

Let $A(n,d,w)$ be the largest possible size of an $(n,d,w)$ constant-weight binary code. By adding new constraints to Delsarte linear programming, we obtain twenty three new upper bounds on $A(n,d,w)$ for $n \leq 28$. The used techniques…

Every finite group $G$ has a normal series each of whose factors is either a solvable group or a direct product of nonabelian simple groups. The minimum number of nonsolvable factors attained on all possible such series is called the…

A linear parameter must be consumed exactly once in the body of its function. When declaring resources such as file handles and manually managed memory as linear arguments, a linear type system can verify that these resources are used…

The completely bounded trace and spectral norms in finite dimensions are shown to be expressible by semidefinite programs. This provides an efficient method by which these norms may be both calculated and verified, and gives alternate…

This paper studies \emph{linear} and \emph{affine} error-correcting codes for correcting synchronization errors such as insertions and deletions. We call such codes linear/affine insdel codes. Linear codes that can correct even a single…

With a view towards models of quantum computation and/or the interpretation of linear logic, we define a functional language where all functions are linear operators by construction. A small step operational semantic (and hence an…

The paper is devoted to the local classification of generic control-affine systems on an n-dimensional manifold with scalar input for any n>3 or with two inputs for n=4 and n=5, up to state-feedback transformations, preserving the affine…