English
Related papers

Related papers: Ruling polynomials and augmentations over finite f…

200 papers

Let $\alpha(\mathbb{F}_q^d,p)$ denote the maximum size of a general position set in a $p$-random subset of $\mathbb{F}_q^d$. We determine the order of magnitude of $\alpha(\mathbb{F}_q^2,p)$ up to polylogarithmic factors for all possible…

Combinatorics · Mathematics 2025-02-21 Yaobin Chen , Xizhi Liu , Jiaxi Nie , Ji Zeng

Let $F(x,y)$ be a polynomial over the rationals. We show that if $F$ is not an expander (over the rationals) then it has a special multiplicative or additive form. For example if $F$ is a homogeneous non-expander polynomial then…

Combinatorics · Mathematics 2012-12-17 Jozsef Solymosi

The mod-2 arithmetic Milnor invariants, introduced by Morishita, provide a decomposition law for primes in canonical Galois extensions of $\mathbb{Q}$ with unitriangular Galois groups, and contain the Legendre and Redei symbols as special…

Number Theory · Mathematics 2024-09-20 Ido Efrat

Lifting theorems are theorems that bound the communication complexity of a composed function $f\circ g^{n}$ in terms of the query complexity of $f$ and the communication complexity of $g$. Such theorems constitute a powerful generalization…

Computational Complexity · Computer Science 2024-04-12 Yahel Manor , Or Meir

In this paper we consider the restriction of a unitary irreducible representation of type $A_{\mathfrak q}(\lambda)$ of $GL(4,{\mathbb R})$ to reductive subgroups $H$ which are the fixpoint sets of an involution. We obtain a formula for the…

Representation Theory · Mathematics 2008-04-25 Bent Orsted , Birgit Speh

We give in this paper a survey of results obtained in our earlier papers, and state explicitly some problems of further research, for example: are the analytic ranks bounded, or not? Twists of Carlitz modules are parametrized by polynomials…

Number Theory · Mathematics 2025-09-22 A. Grishkov , D. Logachev

Let $L \subset \mathbb R \times J^1(M)$ be a spin, exact Lagrangian cobordism in the symplectization of the 1-jet space of a smooth manifold $M$. Assume that $L$ has cylindrical Legendrian ends $\Lambda_\pm \subset J^1(M)$. It is well known…

Symplectic Geometry · Mathematics 2019-02-05 Cecilia Karlsson

If a Legendrian knot $\Lambda$ in the standard contact 3-sphere bounds an orientable exact Lagrangian surface $\Sigma$ in the standard symplectic 4-ball, then the genus of $\Sigma$ is equal to the slice genus of (the smooth knot underlying)…

Symplectic Geometry · Mathematics 2018-03-16 Tolga Etgü

We prove that arbitrary (nonpolynomial) scalar evolution equations of order $m\ge 7$, that are integrable in the sense of admitting the canonical conserved densities $\ro^{(1)}$, $\ro^{(2)}$, and $\ro^{(3)}$ introduced in [MSS,1991], are…

Exactly Solvable and Integrable Systems · Physics 2009-09-09 Eti Mizrahi , Ayşe Hümeyra Bilge

Let $M$ be a connected smooth manifold, let $\operatorname{Aut}(p)$ be the group automorphisms of the bundle $p\colon \mathbb{R}\times M\to \mathbb{R}$, and let $q\colon J^1(\mathbb{R},M)\times \mathbb{R\to }J^1(\mathbb{R},M)$ be the…

Differential Geometry · Mathematics 2017-07-06 Marco Castrillón López , Jaime Muñoz Masqué , Eugenia Rosado María

Each ruling of a Legendrian link can be naturally treated as a surface. For knots, the ruling is 2-graded if and only if the surface is orientable. For 2-graded rulings of homogeneous (in particular, alternating) knots, we prove that the…

Geometric Topology · Mathematics 2007-11-26 Tamás Kálmán

In any graph $G$, the domination number $\gamma(G)$ is at most the independence number $\alpha(G)$. The Inverse Domination Conjecture says that, in any isolate-free $G$, there exists pair of vertex-disjoint dominating sets $D, D'$ with…

Combinatorics · Mathematics 2021-11-15 Elliot Krop , Jessica McDonald , Gregory J. Puleo

Let $A_q(n,d)$ be the maximum order (maximum number of codewords) of a $q$-ary code of length $n$ and Hamming distance at least $d$. And let $A(n,d,w)$ that of a binary code of constant weight $w$. Building on results from algebraic graph…

Information Theory · Computer Science 2008-07-01 Salim Y. El Rouayheb , C. N. Georghiades , E. Soljanin , A. Sprintson

In this work, we extend the robust version of the Sylvester-Gallai theorem, obtained by Barak, Dvir, Wigderson and Yehudayoff, and by Dvir, Saraf and Wigderson, to the case of quadratic polynomials. Specifically, we prove that if…

Computational Geometry · Computer Science 2022-02-11 Shir Peleg , Amir Shpilka

We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible…

Commutative Algebra · Mathematics 2013-11-12 Joachim von zur Gathen , Alfredo Viola , Konstantin Ziegler

We obtain bounds on the number of triples that determine a given pair of dot products arising in a vector space over a finite field or a module over the set of integers modulo a power of a prime. More precisely, given $E\subset \mathbb…

Combinatorics · Mathematics 2015-08-12 David Covert , Steven Senger

Four recursive constructions of permutation polynomials over $\gf(q^2)$ with those over $\gf(q)$ are developed and applied to a few famous classes of permutation polynomials. They produce infinitely many new permutation polynomials over…

Information Theory · Computer Science 2015-11-12 Cunsheng Ding , Pingzhi Yuan

We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…

Number Theory · Mathematics 2012-10-03 Ayah Almousa , Melanie Matchett Wood

Consider the conjugation action of the general linear group $\operatorname{GL}_{2}(K)$ on the polynomial ring $K[X_{2 \times 2}]$. When $K$ is an infinite field, the ring of invariants is a polynomial ring generated by the trace and the…

Commutative Algebra · Mathematics 2025-04-04 Aryaman Maithani

Let $G$ be a simple graph of order $n$. The domination polynomial of $G$ is the polynomial $D(G,\lambda)=\sum_{i=0}^{n} d(G,i) \lambda^{i}$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$. We consider the lexicographic…

Combinatorics · Mathematics 2015-11-26 Saeid Alikhani , Somayeh Jahari