English
Related papers

Related papers: Maximum linearizations of lower sets in $\mathbb{N…

200 papers

In this paper we study complete linear series on a hyperelliptic curve $C$ of arithmetic genus $g$. Let $A$ be the unique line bundle on $C$ such that $|A|$ is a $g^1_2$, and let $\mathcal{L}$ be a line bundle on $C$ of degree $d$. Then…

Algebraic Geometry · Mathematics 2008-08-04 Euisung Park

We study the problem of maximizing a monotone submodular set function subject to linear packing constraints. An instance of this problem consists of a matrix $A \in [0,1]^{m \times n}$, a vector $b \in [1,\infty)^m$, and a monotone…

Data Structures and Algorithms · Computer Science 2012-05-01 Yossi Azar , Iftah Gamzu

We study maximal subalgebras of an arbitrary finite dimensional algebra over a field, and obtain full classification/description results of such algebras. This is done by first obtaining a complete classification in the semisimple case, and…

Rings and Algebras · Mathematics 2017-08-31 Miodrag Iovanov , Alexander Sistko

Let $\omega_0,\dots,\omega_M$ be complex numbers. If $H_0,\dots,H_M$ are polynomials of degree at most $\rho_0,\dots,\rho_M$, and $G(z)=\sum_{m=0} ^M H_m(z) (1-z)^{\omega_m}$ has a zero at $z=0$ of maximal order (for the given…

Number Theory · Mathematics 2021-09-07 Michael A. Bennett , Greg Martin , Kevin O'Bryant

We construct explicit representations of the Heisenberg-Weyl algebra [P,M]=1 in terms of ladder operators acting in the space of Sheffer-type polynomials. Thus we establish a link between the monomiality principle and the umbral calculus.…

Quantum Physics · Physics 2015-06-26 P Blasiak , G Dattoli , A Horzela , K A Penson

In parametric sequence alignment, optimal alignments of two sequences are computed as a function of the penalties for mismatches and spaces, producing many different optimal alignments. Here we give a 3/(2^{7/3}\pi^{2/3})n^{2/3} +O(n^{1/3}…

Genomics · Quantitative Biology 2011-01-19 Cynthia Vinzant

We generalize the existence of maximal orders in a semi-simple algebra for general ground rings. We also improve several statements in Chapter 5 and 6 of Reiner's book concerning separable algebras by removing the separability condition,…

Number Theory · Mathematics 2011-05-17 Chia-Fu Yu

In this paper, we study some new examples of ideals on $\omega$ with maximal Tukey type (that is, maximal among partial orders of size continuum). This discussion segues into an examination of a refinement of the Tukey order -- known as the…

Logic · Mathematics 2023-11-06 Konstantinos A. Beros , Paul B. Larson

There is a natural infinite graph whose vertices are the monomial ideals in a polynomial ring. The definition involves Gr\"obner bases or the action of an algebraic torus. We present algorithms for computing the (affine schemes…

Commutative Algebra · Mathematics 2007-05-23 Klaus Altmann , Bernd Sturmfels

We study a family of $H^m$-conforming piecewise polynomials based on artificial neural network, named as the finite neuron method (FNM), for numerical solution of $2m$-th order partial differential equations in $\mathbb{R}^d$ for any $m,d…

Numerical Analysis · Mathematics 2020-12-30 Jinchao Xu

Let $\{a_i\}_{i=1}^\ell$ be a strongly unimodal positive integer sequence with peak position $k$. The rank of such sequence is defined to be $\ell-2k+1$. Let $u(m,n)$ denote the number of sequences $\{a_i\}_{i=1}^\ell$ with rank $m$ and…

Combinatorics · Mathematics 2024-07-26 Wenston J. T. Zang

For a finite set $A\subset\mathbb{N}$ and $k\in \mathbb{N}$, let $\omega_k(A) = \sum_{i\in A, i\neq k}1$. For each $n\in \mathbb{N}$, define $$a_{k, n}\ =\ |\{E\subset \mathbb{N}\,:\, E = \emptyset\mbox{ or } \omega_k(E) < \min E\leqslant…

Combinatorics · Mathematics 2024-05-31 Hung Viet Chu , Zachary Louis Vasseur

Given a well-quasi-order $X$ and an ordinal $\alpha$, the set $s^F_\alpha(X)$ of transfinite sequences on $X$ with length less than $\alpha$ and with finite image is also a well-quasi-order, as proven by Nash-Williams. Before Nash-Williams…

Logic · Mathematics 2026-03-11 Harry Altman

For an arbitrary ideal $I$ in a polynomial ring $R$ we define the notion of initially regular sequences on $R/I$. These sequences share properties with regular sequences. In particular, the length of an initially regular sequence provides a…

Commutative Algebra · Mathematics 2019-07-02 Louiza Fouli , Huy Tai Ha , Susan Morey

The core of an ideal is defined as the intersection of all of its reductions. In this paper we provide an explicit description for the core of a monomial ideal $I$ satisfying certain residual conditions, showing that ${\rm core}(I)$…

Commutative Algebra · Mathematics 2023-03-21 Louiza Fouli , Jonathan Montaño , Claudia Polini , Bernd Ulrich

Let $S_n$ be a polynomial ring with $n$ variables over a field and $\{I_n\}_{n \geq 1}$ a chain of ideals such that each $I_n$ is a monomial ideal of $S_n$ fixed by permutations of the variables. In this paper, we present a way to determine…

Commutative Algebra · Mathematics 2019-07-24 Satoshi Murai

A monomial algebra is the quotient of a polynomial algebra by an ideal generated by monomials. We prove that finite-dimensional monomial algebras are characterized by their automorphism group among finite-dimensional, local algebras with…

Commutative Algebra · Mathematics 2026-05-13 Roberto Díaz , Giancarlo Lucchini Arteche

In this paper we investigate the question of normality for special monomial ideals in a polynomial ring over a field. We first include some expository sections that give the basics on the integral closure of a ideal, the Rees algebra on an…

Commutative Algebra · Mathematics 2007-05-23 Marie A. Vitulli

The linear induced matching width (LMIM-width) of a graph is a width parameter defined by using the notion of branch-decompositions of a set function on ternary trees. In this paper we study output-polynomial enumeration algorithms on…

Data Structures and Algorithms · Computer Science 2015-09-16 Petr A. Golovach , Pinar Heggernes , Mamadou Moustapha Kanté , Dieter Kratsch , Sigve H. Sæther , Yngve Villanger

For integers $m$ and $n$, we study the problem of finding good lower bounds for the size of progression-free sets in $(\mathbb{Z}_{m}^{n},+)$. Let $r_{k}(\mathbb{Z}_{m}^{n})$ denote the maximal size of a subset of $\mathbb{Z}_{m}^{n}$…

Number Theory · Mathematics 2023-01-02 Christian Elsholtz , Benjamin Klahn , Gabriel F. Lipnik