English
Related papers

Related papers: Reverse Lexicographic and Lexicographic Shifting

200 papers

The aim of this paper is to study some properties of left translates of a square integrable function on the Heisenberg group. First, a necessary and sufficient condition for the existence of the canonical dual to a function $\varphi\in…

Functional Analysis · Mathematics 2017-12-04 R. Radha , Saswata Adhikari

Let $S$ be a polynomial ring over a field and $I\subseteq S$ a homogeneous ideal containing a regular sequence of forms of degrees $d_1, \ldots, d_c$. In this paper we prove the Lex-plus-powers Conjecture when the field has characteristic 0…

Commutative Algebra · Mathematics 2019-03-26 Giulio Caviglia , Alessio Sammartano

A symmetric ideal is an ideal in a polynomial ring which is stable under all permutations of the variables. In this paper we initiate a global study of zero-dimensional symmetric ideals. By this we mean a geometric study of the invariant…

Algebraic Geometry · Mathematics 2025-09-15 Sebastian Debus , Andreas Kretschmer

Szemer\'edi's regularity lemma is a powerful tool in graph theory. It states that for every large enough graph, there exists a partition of the edge set with bounded size such that most induced subgraphs are quasirandom. When the graph is a…

Combinatorics · Mathematics 2022-09-20 Alexis Chevalier , Elad Levi

A nonzero locally nilpotent linear derivation of the polynomial algebra K[X] in d variables over a field K of characteristic 0 is called a Weitzenboeck derivation. The classical theorem of Weitzenboeck states that the algebra of constants…

Rings and Algebras · Mathematics 2013-02-05 Rumen Dangovski , Vesselin Drensky , Sehmus Findik

Given integers $\Delta\ge 2$ and $t\ge 2\Delta$, suppose there is a graph of maximum degree $\Delta$ and a partition of its vertices into blocks of size at least $t$. By a seminal result of Haxell, there must be some independent set of the…

Combinatorics · Mathematics 2024-07-08 Pjotr Buys , Ross J. Kang , Kenta Ozeki

Every (left) linear function on a subspace of a finite-dimensional vector space over a (skew) field can be extended to a (left) linear function on the whole space. This paper explores the extent to what this basic fact of linear algebra is…

Combinatorics · Mathematics 2017-08-24 Yaroslav Shitov

We introduce a class of algebras over a field $\mathbb{F}$ related to directed graphs in which all edges are labeled by nonzero elements of the field $\mathbb{F}$. If all labels are different from $1$, these algebras are axial algebras. We…

Commutative Algebra · Mathematics 2026-03-05 Hans Cuypers

When studying local properties of a polynomial ideal, one usually needs a theoretic technique called localization. For most cases, in spite of its importance, the computation in a localized ring cannot be algorithmically preformed. On the…

Symbolic Computation · Computer Science 2015-02-16 Ye Liang

Let $K$ be a infinite field, $S=K[x_1,\ldots,x_n]$ and $0\subset I\subsetneq J\subset S$ two squarefree monomial ideals. In a previous paper we proved a new formula for the Hilbert depth of $J/I$. In this paper, we illustrate how one can…

Commutative Algebra · Mathematics 2024-04-29 Silviu Balanescu , Mircea Cimpoeas

The standard twist of $L$-functions plays a fundamental role in the Selberg class theory. It is defined as an absolutely convergent Dirichlet series and admits meromorphic continuation beyond the half-plane of absolute convergence.…

Number Theory · Mathematics 2026-03-17 Jerzy Kaczorowski , Alberto Perelli

If $d$ is a boundary defining function for the Euclidean unit disk and $I$ denotes the geodesic X-ray transform, for $\gamma\in (-1,1)$, we study the singularly-weighted X-ray transforms $I_m d^\gamma$ acting on symmetric $m$-tensors. For…

Analysis of PDEs · Mathematics 2025-11-13 Jonathan Kay , François Monard

For a finite index sublattice $L$ of the root lattice $A_{n}$, we construct a deterministic algorithm to deform the lattice ideal $I_L$ to a nearby generic lattice ideal, answering a question posed by Miller and Sturmfels. Our algorithm is…

Combinatorics · Mathematics 2015-08-19 Spencer Backman , Madhusudan Manjunath

In this paper, we prove the following two results. Let $d$ be a natural number and $q,s$ be co-prime integers such that $1 < qs$. Then there exists a constant $\delta > 0$ depending only on $q,s$ and $d$ such that for any finite subset $A$…

Combinatorics · Mathematics 2019-05-28 Akshat Mudgal

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

Let S be a polynomial ring and R=S/I where I is a graded ideal of S. The Multiplicity Conjecture of Herzog, Huneke, and Srinivasan which was recently proved using the Boij-Soederberg theory states that the multiplicity of R is bounded above…

Commutative Algebra · Mathematics 2021-05-18 Tim Roemer

We are concerned with rigid analytic geometry in the general setting of Henselian fields $K$ with separated analytic structure, whose theory was developed by Cluckers--Lipshitz--Robinson. It unifies earlier work and approaches of numerous…

Algebraic Geometry · Mathematics 2019-07-19 Krzysztof Jan Nowak

We analyze a real one-parameter family of quasiconformal deformations of a hyperbolic rational map known as {\em spinning}. We show that under fairly general hypotheses, the limit of spinning either exists and is unique, or else converges…

Dynamical Systems · Mathematics 2016-09-07 Kevin M. Pilgrim , Tan Lei

Great progress has been made in unsupervised bilingual lexicon induction (UBLI) by aligning the source and target word embeddings independently trained on monolingual corpora. The common assumption of most UBLI models is that the embedding…

Computation and Language · Computer Science 2021-05-27 Hailong Cao , Tiejun Zhao

The gloabal objective of inverse Reinforcement Learning (IRL) is to estimate the unknown cost function of some MDP base on observed trajectories generated by (approximate) optimal policies. The classical approach consists in tuning this…

Machine Learning · Computer Science 2021-05-26 Firas Jarboui , Vianney Perchet