English
Related papers

Related papers: Unlinking Theorem for Symmetric Quasi-convex Polyn…

200 papers

This paper presents a noncommutative theory of symmetric functions, based on the notion of quasi-determinant. We begin with a formal theory, corresponding to the case of symmetric functions in an infinite number of independent variables.…

High Energy Physics - Theory · Physics 2008-02-03 Israel Gelfand , D. Krob , Alain Lascoux , B. Leclerc , V. S. Retakh , J. -Y. Thibon

For any subgroup $G$ of the symmetric group $\mathcal{S}_n$ on $n$ symbols, we present results for the uniform $\mathcal{C}^k$ approximation of $G$-invariant functions by $G$-invariant polynomials. For the case of totally symmetric…

Machine Learning · Computer Science 2024-03-05 Soumya Ganguly , Khoa Tran , Rahul Sarkar

We study the polynomial approximation of symmetric multivariate functions and of multi-set functions. Specifically, we consider $f(x_1, \dots, x_N)$, where $x_i \in \mathbb{R}^d$, and $f$ is invariant under permutations of its $N$…

Numerical Analysis · Mathematics 2023-02-06 Markus Bachmayr , Geneviève Dusson , Christoph Ortner , Jack Thomas

We prove that, if $g$ is a continuous asymptotically convex function, any solution $u$ of $-\Delta u+g(u)=0$ in a ball B which tends to infinity on $\partial B$ is radially symmetric.

Analysis of PDEs · Mathematics 2008-12-18 Alessio Porretta , Laurent Veron

In theory of one complex variable, Gauss-Lucas Theorem states that the critical points of a non constant polynomial belong to the convex hull of the set of zeros of the polynomial. The exact analogue of this result cannot hold, in general,…

Complex Variables · Mathematics 2017-11-08 Sorin G. Gal , J. Oscar González-Cervantes , Irene Sabadini

An independent set in a graph is a set of pairwise non-adjacent vertices, and a(G) is the size of a maximum independent set in the graph G. If s_{k} is the number of independent sets of cardinality k in G, then…

Discrete Mathematics · Computer Science 2013-03-12 Vadim E. Levit , Eugen Mandrescu

Let $G=(V(G), E(G))$ be an undirected graph with a measure function $\mu$ assigning non-negative values to subgraphs $H$ so that $\mu(H)$ does not exceed the clique cover number of $H$. When $\mu$ satisfies some additional natural…

Computational Geometry · Computer Science 2015-04-21 Farhad Shahrokhi

In this paper we study quasi-orthogonality on the unit circle based on the structural and orthogonal properties of a class of self-invariant polynomials. We discuss a special case in which these polynomials are represented in terms of the…

Functional Analysis · Mathematics 2022-03-15 Kiran Kumar Behera

We prove that the Farrell-Jones isomorphism conjecture for non-connective algebraic K-theory for a discrete group G and a coefficient ring R holds true if G belongs to the class of groups acting on trees, under certain conditions on G (see…

Algebraic Topology · Mathematics 2012-03-13 Marcelo Gomez Morteo

A characterization of right (left) quasi-duo skew polynomial rings of endomorphism type and skew Laurent polynomial rings are given. In particular, it is shown that (1) the polynomial ring R[x] is right quasi-duo iff R[x] is commutative…

Rings and Algebras · Mathematics 2009-10-29 Andre Leroy , Jerzy Matczuk , Edmund R. Puczylowski

Hoang, Levit, Mandrescu and Pham asked for structural conditions ensuring that the independence polynomial of a $\W_p$ graph is log-concave, or at least unimodal, and conjectured that a connected $\W_2$ graph is $2$-quasi-regularizable if…

Combinatorics · Mathematics 2026-05-15 Kevin Pereyra

We consider a polynomial $P\in \mathbb{R}[x_{1},\cdots, x_{d}]$ of degree $ \delta $ that depends non-trivially on each of $x_1,...,x_d$ with $d\geq 2$. For any integer $t$ with $2\leq t\leq d$, any natural number $n \in \mathbb{N}$, and…

Combinatorics · Mathematics 2026-03-09 Yewen Sun

We study the ring of quasisymmetric polynomials in $n$ anticommuting (fermionic) variables. Let $R_n$ denote the polynomials in $n$ anticommuting variables. The main results of this paper show the following interesting facts about…

Combinatorics · Mathematics 2022-11-29 Nantel Bergeron , Kelvin Chan , Farhad Soltani , Mike Zabrocki

Consider a group G and an epimorphism u_0:G\to\Z inducing a splitting of G as a semidirect product ker(u_0)\rtimes_\varphi\Z with ker(u_0) a finitely generated free group and \varphi\in Out(ker(u_0)) representable by an expanding…

Geometric Topology · Mathematics 2016-09-06 Spencer Dowdall , Ilya Kapovich , Christopher J. Leininger

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…

Commutative Algebra · Mathematics 2014-07-14 Joachim von zur Gathen , Konstantin Ziegler

We prove a structural result for degree-$d$ polynomials. In particular, we show that any degree-$d$ polynomial, $p$ can be approximated by another polynomial, $p_0$, which can be decomposed as some function of polynomials $q_1,...,q_m$ with…

Probability · Mathematics 2012-08-17 Daniel M. Kane

In this paper, we examine how far a polynomial in $\mathbb{F}_2[x]$ can be from a squarefree polynomial. For any $\epsilon>0$, we prove that for any polynomial $f(x)\in\mathbb{F}_2[x]$ with degree $n$, there exists a squarefree polynomial…

Number Theory · Mathematics 2019-06-20 Michael Filaseta , Richard A. Moy

An invertible polynomial in $n$ variables is a quasihomogeneous polynomial consisting of $n$ monomials so that the weights of the variables and the quasi-degree are well defined. In the framework of the construction of mirror symmetric…

Algebraic Geometry · Mathematics 2014-07-02 Wolfgang Ebeling , Sabir M. ~Gusein-Zade

Let $G_k$ be a connected reductive algebraic group over an algebraically closed field $k$ of characteristic $\neq 2$. Let $K_k \subset G_k$ be a quasi-split symmetric subgroup of $G_k$ with respect to an involution $\theta_k$ of $G_k$. The…

Representation Theory · Mathematics 2022-12-29 Huanchen Bao , Jinfeng Song

A function g, with domain the natural numbers, is a quasi-polynomial if there exists a period m and polynomials p_0,p_1,...,p_{m-1} such that g(t)=p_i(t) for t=i mod m. Quasi-polynomials classically -- and "reasonably" -- appear in Ehrhart…

Combinatorics · Mathematics 2014-03-04 Kevin Woods