English
Related papers

Related papers: An Improved Construction of Variety-Evasive Subspa…

200 papers

We introduce the problem of constructing explicit variety evasive subspace families. Given a family $\mathcal{F}$ of subvarieties of a projective or affine space, a collection $\mathcal{H}$ of projective or affine $k$-subspaces is…

Computational Complexity · Computer Science 2024-10-15 Zeyu Guo

In the affine space $\mathbb{F}_q^n$ over the finite field of order $q$, a point set $S$ is said to be $(d,k,r)$-evasive if the intersection between $S$ and any variety, of dimension $k$ and degree at most $d$, has cardinality less than…

Combinatorics · Mathematics 2025-07-11 Jeck Lim , Jiaxi Nie , Ji Zeng

In this work we describe an explicit, simple, construction of large subsets of F^n, where F is a finite field, that have small intersection with every k-dimensional affine subspace. Interest in the explicit construction of such sets, termed…

Computational Complexity · Computer Science 2011-10-27 Zeev Dvir , Shachar Lovett

We give an explicit construction of a large subset of F^n, where F is a finite field, that has small intersection with any affine variety of fixed dimension and bounded degree. Our construction generalizes a recent result of Dvir and Lovett…

Computational Complexity · Computer Science 2012-03-21 Zeev Dvir , János Kollár , Shachar Lovett

We introduce and explore a new concept of evasive subspace with respect to a collection of subspaces sharing a common dimension, most notably partial spreads. We show that this concept generalises known notions of subspace scatteredness and…

Combinatorics · Mathematics 2023-10-17 Anina Gruica , Alberto Ravagnani , John Sheekey , Ferdinando Zullo

We study the arithmetic complexity of hitting set generators, which are pseudorandom objects used for derandomization of the polynomial identity testing problem. We give new explicit constructions of hitting set generators whose outputs are…

Computational Complexity · Computer Science 2025-08-19 Robert Andrews

We study explicit constructions of min-wise hash families and their extension to $k$-min-wise hash families. Informally, a min-wise hash family guarantees that for any fixed subset $X\subseteq[N]$, every element in $X$ has an equal chance…

Data Structures and Algorithms · Computer Science 2025-11-11 Xue Chen , Shengtang Huang , Xin Li

Let $f : X \to S$ be a family of smooth projective algebraic varieties over a smooth connected quasi-projective base $S$, and let $\mathbb{V} = R^{2k} f_{*} \mathbb{Z}(k)$ be the integral variation of Hodge structure coming from degree $2k$…

Algebraic Geometry · Mathematics 2023-08-21 David Urbanik

Given a reference model that includes all the available variables, projection predictive inference replaces its posterior with a constrained projection including only a subset of all variables. We extend projection predictive inference to…

Computation · Statistics 2021-09-13 Alejandro Catalina , Paul Bürkner , Aki Vehtari

In this article we develop a new way of systematically constructing infinitely many families of smooth subvarieties $X$ of any given dimension $m$, $m \geq 3$, and any given codimension in $\mathbb P^N$, embedded by complete subcanonical…

Algebraic Geometry · Mathematics 2022-12-20 Purnaprajna Bangere , Francisco Javier Gallego , Jayan Mukherjee , Debaditya Raychaudhury

Statistical modeling of spatiotemporal phenomena often requires selecting a covariance matrix from a covariance class. Yet standard parametric covariance families can be insufficiently flexible for practical applications, while…

Computation · Statistics 2020-12-24 Antoni Musolas , Steven T. Smith , Youssef Marzouk

Variational autoencoders (VAE) often use Gaussian or category distribution to model the inference process. This puts a limit on variational learning because this simplified assumption does not match the true posterior distribution, which is…

Machine Learning · Computer Science 2017-02-28 Ke Sun , Xiangliang Zhang

This paper studies separating invariants: mappings on $D$ dimensional domains which are invariant to an appropriate group action, and which separate orbits. The motivation for this study comes from the usefulness of separating invariants in…

Machine Learning · Computer Science 2023-11-22 Nadav Dym , Steven J. Gortler

An avoshift is a subshift where for each set $C$ from a suitable family of subsets of the shift group, the set of all possible valid extensions of a globally valid pattern on $C$ to the identity element is determined by a bounded…

Dynamical Systems · Mathematics 2024-08-20 Ville Salo

We study pseudodeterministic constructions, i.e., randomized algorithms which output the same solution on most computation paths. We establish unconditionally that there is an infinite sequence $\{p_n\}_{n \in \mathbb{N}}$ of increasing…

Computational Complexity · Computer Science 2016-12-07 Igor C. Oliveira , Rahul Santhanam

Variational inference for latent variable models is prevalent in various machine learning problems, typically solved by maximizing the Evidence Lower Bound (ELBO) of the true data likelihood with respect to a variational distribution.…

Machine Learning · Computer Science 2018-07-11 Guoqing Zheng , Yiming Yang , Jaime Carbonell

The study of twisted representations of graded vertex algebras is important for understanding orbifold models in conformal field theory. In this paper we consider the general set-up of a vertex algebra $V$, graded by $\G/\Z$ for some…

Representation Theory · Mathematics 2015-05-28 Jethro Van Ekeren

A 1-dimensional generalization of the well known Logistic Map is proposed. The proposed family of maps is referred to as the B-Exponential Map. The dynamics of this map are analyzed and found to have interesting properties. In particular,…

Cryptography and Security · Computer Science 2011-01-25 Mahesh C Shastry , Nithin Nagaraj , Prabhakar G Vaidya

A finite transitive permutation group is elusive if it contains no derangements of prime order. These groups are closely related to a longstanding open problem in algebraic graph theory known as the Polycirculant Conjecture, which asserts…

Group Theory · Mathematics 2026-03-19 Jiyong Chen , Melissa Lee , Dorde Mitrovic , E. A. O'Brien , Binzhou Xia

In a set equipped with a binary operation, (S,*), a subset U is defined to be avoidable if there exists a partition {A,B} of S such that no element of U is the product of two distinct elements of A or of two distinct elements of B. For more…

Combinatorics · Mathematics 2007-05-23 Mike Develin
‹ Prev 1 2 3 10 Next ›