Related papers: Projection-Forcing Multisets of Weight Changes
We study conditions on a commutative ring R which are equivalent to the following requirement; whenever X is a projective scheme over S = Spec(R) of fiber dimension \leq d for some integer d \geq 0, there is a finite morphism from X to…
For an arbitrary finite set S of natural numbers greater 1, we construct an integer-valued polynomial f, whose set of lengths in Int(Z) is S. The set of lengths of f is the set of all natural numbers n, such that f has a factorization as a…
We prove that the pushforwards of a very general class of fractal measures $\mu$ on $\mathbb{R}^d$ under a large family of non-linear maps $F \colon \mathbb{R}^d \to \mathbb{R}$ exhibit polynomial Fourier decay: there exist $C,\eta>0$ such…
A projective linear code over $\mathbb{F}_q$ is called $\Delta$-divisible if all weights of its codewords are divisible by $\Delta$. Especially, $q^r$-divisible projective linear codes, where $r$ is some integer, arise in many applications…
This paper contains four main results associated with an attractor of a projective iterated function system (IFS). The first theorem characterizes when a projective IFS has an attractor which avoids a hyperplane. The second theorem…
We develop a toolbox for forcing over arbitrary models of set theory without the axiom of choice. In particular, we introduce a variant of the countable chain condition and prove an iteration theorem that applies to many classical forcings…
We consider the geometric problem of determining the maximum number $n_q(r,h,f;s)$ of $(h-1)$-spaces in the projective space $\operatorname{PG}(r-1,q)$ such that each subspace of codimension $f$ does contain at most $s$ elements. In coding…
A forcing extension may create new isomorphisms between two models of a first order theory. Certain model theoretic constraints on the theory and other constraints on the forcing can prevent this pathology. A countable first order theory is…
We prove that for an arbitrary upper semi-continuous function $\phi\colon G(1,2) \to [0,1]$ there exists a compact set $F$ in the plane such that $\dim_{\textrm{A}} \pi F = \phi(\pi)$ for all $\pi \in G(1,2)$, where $\pi F$ is the…
We give a sufficient condition for a bi-invariant weight on a Frobenius bimodule to satisfy the extension property. This condition applies to bi-invariant weights on a finite Frobenius ring as a special case. The complex-valued functions on…
We explore solutions for fairly allocating indivisible items among agents assigned weights representing their entitlements. Our fairness goal is weighted-envy-freeness (WEF), where each agent deems their allocated portion relative to their…
Let $f(n)$ be a strongly additive complex valued arithmetic function. Under mild conditions on $f$, we prove the following weighted strong law of large numbers: if $ X,X_1,X_2,... $ is any sequence of integrable i.i.d. random variables,…
In this article we study convex integer maximization problems with composite objective functions of the form $f(Wx)$, where $f$ is a convex function on $\R^d$ and $W$ is a $d\times n$ matrix with small or binary entries, over finite sets…
The classical Stein--Tomas theorem extends the theory of linear Fourier restriction estimates from smooth manifolds to fractal measures exhibiting Fourier decay. In the multilinear setting, transversality allows for Fourier extension…
A multivalued projection is an idempotent linear relation with invariant domain. We characterize multivalued projections that are operator ranges (called semiclosed) and provide several formulae of them. Moreover, we study the…
In this paper, we study square functions for extension operators over finite-type, planar curves endowed with the Euclidean arclength measure. We prove new results for curves of the form $(T,\phi(T))$ where $\phi(T)$ is a polynomial of…
The purpose of this paper is to investigate forcing as a tool to construct universal models. In particular, we look at theories of initial segments of the universe and show that any model of a sufficiently rich fragment of those theories…
For classification problems, feature extraction is a crucial process which aims to find a suitable data representation that increases the performance of the machine learning algorithm. According to the curse of dimensionality theorem, the…
We give a complexity dichotomy for the problem of computing the partition function of a weighted Boolean constraint satisfaction problem. Such a problem is parameterized by a set of rational-valued functions, which generalize constraints.…
Large language models have steadily increased in size to achieve improved performance; however, this growth has also led to greater inference time and computational demands. Consequently, there is rising interest in model size reduction…