English
Related papers

Related papers: The $k$-resultant modulus set problem on algebraic…

200 papers

Inspired by recent work of Carlson, Friedlander and Pevtsova concerning modules for $p$-elementary abelian groups $E_r$ of rank $r$ over a field of characteristic $p > 0$, we introduce the notions of modules with constant $d$-radical rank…

Representation Theory · Mathematics 2016-10-06 Daniel Bissinger

Given a polynomial system $\mathcal{F}$ over a finite field $k$ which is not necessarily of dimension zero, we consider the Weil descent $\mathcal{F}'$ of $\mathcal{F}$ over a subfield $k'$. We prove a theorem which relates the last fall…

Algebraic Geometry · Mathematics 2021-03-15 Ming-Deh Huang

A classical open problem in combinatorial geometry is to obtain tight asymptotic bounds on the maximum number of k-level vertices in an arrangement of n hyperplanes in d dimensions (vertices with exactly k of the hyperplanes passing below…

Computational Geometry · Computer Science 2020-03-17 M. Sharir , C. Ziv

We contribute to the Malle conjecture on the number N (K, G, y) of finite Galois extensions E of some number field K of finite group G and of discriminant of norm |N K/Q (d E)| $\le$ y. We prove the lower bound part of the conjecture for…

Number Theory · Mathematics 2019-01-01 François Motte

We consider the class of polynomial optimization problems $\inf \{f(x):x\in K\}$ for which the quadratic module generated by the polynomials that define $K$ and the polynomial $c-f$ (for some scalar $c$) is Archimedean. For such problems,…

Optimization and Control · Mathematics 2013-07-05 Vaithilingam Jeyakumar , Jean-Bernard Lasserre , G. Li

Let k be a field, let A a finite-dimensional hereditary k-algebra. We consider the category of all finite-dimensional A-modules. We are going to characterize the representation type of A (tame or wild) in terms of the possible subcategories…

Representation Theory · Mathematics 2014-07-22 Mustafa A. A. Obaid , S. Khalid Nauman , Wafaa M. Fakieh , Claus Michael Ringel

For a field $\mathbb{F}$ and integers $d, k$ and $\ell$, a set $A \subseteq \mathbb{F}^d$ is called $(k,\ell)$-nearly orthogonal if all vectors in $A$ are non-self-orthogonal and every $k+1$ vectors in $A$ contain $\ell + 1$ pairwise…

Combinatorics · Mathematics 2025-05-30 Rajko Nenadov , Lander Verlinde

Let $\alpha$ be an algebraic number of degree $d\ge 3$ and let $K$ be the algebraic number field $\Q(\alpha)$. When $\varepsilon$ is a unit of $K$ such that $\Q(\alpha\varepsilon)=K$, we consider the irreducible polynomial $f_\varepsilon(X)…

Number Theory · Mathematics 2013-12-30 Claude Levesque , Michel Waldschmidt

A differential algebra of finite type over a field k is a filtered algebra A, such that the associated graded algebra is finite over its center, and the center is a finitely generated k-algebra. The prototypical example is the algebra of…

Rings and Algebras · Mathematics 2007-05-23 Amnon Yekutieli , James J. Zhang

Modular Decomposition focuses on repeatedly identifying a module M (a collection of vertices that shares exactly the same neighbourhood outside of M) and collapsing it into a single vertex. This notion of exactitude of neighbourhood is very…

Discrete Mathematics · Computer Science 2021-01-25 Michel Habib , Lalla Mouatadid , Eric Sopena , Mengchuan Zou

Let $R$ be a finite unital commutative ring. We introduce a new class of finite groups, which we call hereditary groups over $R$. Our main result states that if $G$ is a hereditary group over $R$ then a unital algebra isomorphism between…

Representation Theory · Mathematics 2020-05-12 Taro Sakurai

The $k$-Even Set problem is a parameterized variant of the Minimum Distance Problem of linear codes over $\mathbb F_2$, which can be stated as follows: given a generator matrix $\mathbf A$ and an integer $k$, determine whether the code…

Computational Complexity · Computer Science 2018-03-28 Arnab Bhattacharyya , Suprovat Ghoshal , Karthik C. S. , Pasin Manurangsi

In this paper, we derive an explicit combinatorial formula for the number of $k$-subset sums of quadratic residues over finite fields.

Number Theory · Mathematics 2017-02-13 Weiqiong Wang , Liping Wang , Haiyan Zhou

In the submodular cover problem, we are given a non-negative monotone submodular function $f$ over a ground set $E$ of items, and the goal is to choose a smallest subset $S \subseteq E$ such that $f(S) = Q$ where $Q = f(E)$. In the…

Data Structures and Algorithms · Computer Science 2018-11-01 Arpit Agarwal , Sepehr Assadi , Sanjeev Khanna

A vector space partition of $\mathbb{F}_q^v$ is a collection of subspaces such that every non-zero vector is contained in a unique element. We improve a lower bound of Heden, in a subcase, on the number of elements of the smallest occurring…

Combinatorics · Mathematics 2018-09-27 Sascha Kurz

We prove that a sufficiently large subset of the $d$-dimensional vector space over a finite field with $q$ elements, $ {\Bbb F}_q^d$, contains a copy of every $k$-simplex. Fourier analytic methods, Kloosterman sums, and bootstrapping play…

Classical Analysis and ODEs · Mathematics 2007-10-11 Derrick Hart , Alex Iosevich

A conjecture of De Concini Kac and Procesi provides a bound on the minimal possible dimension of an irreducible module for quantized enveloping algebras at an odd root of unity. We pose the problem of the existence of modules whose…

Representation Theory · Mathematics 2016-07-20 Giovanna Carnovale , Iulian I. Simion

The existence of certain Fq-spaces of differential forms of the projective line over a field K containing Fq leads us to prove an identity linking the determinant of the Moore matrix of n indeterminates with the determinant of the Moore…

Commutative Algebra · Mathematics 2022-04-26 Jean Fresnel , Michel Matignon

We study the following problem: Given a variable of interest, we would like to find a best linear predictor for it by choosing a subset of $k$ relevant variables obeying a matroid constraint. This problem is a natural generalization of…

Data Structures and Algorithms · Computer Science 2023-01-19 Theophile Thiery , Justin Ward

We study the following variant of the Erd\H{o}s distance problem. Given $E$ and $F$ a point sets in $\mathbb{R}^d$ and $p = (p_1, \ldots, p_q)$ with $p_1+ \cdots + p_q = d$ is an increasing partition of $d$ define $$ B_p(E,F)=\{(|x_1-y_1|,…

Combinatorics · Mathematics 2017-12-13 Alex Iosevich , Maria Janczak , Jonathan Passant
‹ Prev 1 8 9 10 Next ›