English
Related papers

Related papers: Free resolutions of function classes via order com…

200 papers

We provide some new conditions under which the graded Betti numbers of a monomial ideal can be computed in terms of the graded Betti numbers of smaller ideals, thus complementing Eliahou and Kervaire's splitting approach. As applications,…

Commutative Algebra · Mathematics 2009-02-14 Christopher A. Francisco , Huy Tai Ha , Adam Van Tuyl

Let $R=K[x_1,\ldots, x_n]$ be the polynomial ring in $n$ variables over a field $K$ and let $I$ be a monomial ideal of $R$. In this paper, we present an explicit formula for the Betti numbers of almost complete intersection monomial ideals,…

Commutative Algebra · Mathematics 2025-05-27 Amir Mafi , Rando Rasul Qadir

We study monomial cut ideals associated to a graph $G$, which are a monomial analogue of toric cut ideals as introduced by Sturmfels and Sullivant. Primary decompositions, projective dimensions, and Castelnuovo-Mumford regularities are…

Commutative Algebra · Mathematics 2021-12-09 Jürgen Herzog , Masoomeh Rahimbeigi , Tim Römer

We first describe a situation in which every graded Betti number in the tail of the resolution of $\frac RJ$ may be read from the socle degrees of $\frac RJ$. Then we apply the above result to the ideals $J$ and $J^{[q]}$; and thereby…

Commutative Algebra · Mathematics 2008-12-31 Andrew R. Kustin , Bernd Ulrich

This paper is concerned with the taxonomy of finitely complete categories, based on 'matrix properties' - these are a particular type of exactness properties that can be represented by integer matrices. In particular, the main result of the…

Category Theory · Mathematics 2022-05-14 Michael Hoefnagel , Pierre-Alain Jacqmin , Zurab Janelidze

Let $R=k[x_1, ..., x_n]$ be a polynomial ring and let $I\subset R$ be a graded ideal. In \cite{R}, R\"{o}mer asked whether under the Cohen-Macaulay assumption the $i$-th Betti number $\beta_{i}(R/I)$ can be bounded above by a function of…

Commutative Algebra · Mathematics 2007-05-23 Rosa M. Miró-Roig

The finite families of biorthogonal rational functions and orthogonal polynomials of Hahn type are interpreted algebraically in a unified way by considering the three-generated meta Hahn algebra and its finite-dimensional representations.…

Mathematical Physics · Physics 2025-09-10 Satoshi Tsujimoto , Luc Vinet , Alexei Zhedanov

This paper is concerned with the question of whether geometric structures such as cell complexes can be used to simultaneously describe the minimal free resolutions of all powers of a monomial ideal. We provide a full answer in the case of…

Commutative Algebra · Mathematics 2021-08-18 Susan M. Cooper , Sabine El Khoury , Sara Faridi , Sarah Mayes-Tang , Susan Morey , Liana M. Sega , Sandra Spiroff

Let $\mathfrak{f}_{c,2}$ denote a free class-$c$ Lie rings on $2$ generators. We investigate the zeta functions enumerating graded ideals in $\mathfrak{f}_{c,2}(\mathbb{F}_p)$ for $c\leq6$, prove that they are uniformly given by polynomials…

Rings and Algebras · Mathematics 2022-09-16 Marcus du Sautoy , Seungjai Lee

We consider infinite $\Z_\Z$-index complexes $\mathcal C$ of spaces with elements depending on a number of parameters, complete with respect to a linear associative regular inseparable multilinear product. The existence of nets of vanishing…

Functional Analysis · Mathematics 2026-03-06 Daniel Levin , Alexander Zuevsky

We show (almost) separation between certain important classes of Boolean functions. The technique that we use is to show that the total influence of functions in one class is less than the total influence of functions in the other class. In…

Computational Complexity · Computer Science 2020-10-23 Aniruddha Biswas , Palash Sarkar

Recent results of Bucciarelli show that the semilattice of degrees of parallelism of first-order boolean functions in PCF has both infinite chains and infinite antichains. By considering a simple subclass of Sieber's sequentiality…

Programming Languages · Computer Science 2007-05-23 Riccardo Pucella , Prakash Panangaden

Determining the approximate degree composition for Boolean functions remains a significant unsolved problem in Boolean function complexity. In recent decades, researchers have concentrated on proving that approximate degree composes for…

Computational Complexity · Computer Science 2025-01-22 Sourav Chakraborty , Chandrima Kayal , Rajat Mittal , Manaswi Paraashar , Nitin Saurabh

Classification of Non-linear Boolean functions is a long-standing problem in the area of theoretical computer science. In this paper, effort has been made to achieve a systematic classification of all n-variable Boolean functions, where…

Logic in Computer Science · Computer Science 2013-03-15 Ranjeet Kumar Rout , Pabitra Pal Choudhury , Sudhakar Sahoo

Functions with uniform sublevel sets can represent orders, preference relations or other binary relations and thus turn out to be a tool for scalarization that can be used in multicriteria optimization, decision theory, mathematical…

Optimization and Control · Mathematics 2017-12-06 Petra Weidner

Orthogonality is a notion based on the duality between programs and their environments used to determine when they can be safely combined. For instance, it is a powerful tool to establish termination properties in classical formal systems.…

Logic in Computer Science · Computer Science 2024-02-14 Marcelo Fiore , Zeinab Galal , Farzad Jafarrahmani

We investigate possible linear, algebraic, and Frobenius flock characteristic sets of matroids. In particular, we classify possible combinations of linear and algebraic characteristic sets when the algebraic characteristic set is finite or…

Combinatorics · Mathematics 2024-02-23 Dustin Cartwright , Dony Varghese

We study a natural complexity measure of Boolean functions known as the rational degree. Denoted $\textrm{rdeg}(f)$, it is the minimal degree of a rational function that is equal to $f$ on the Boolean hypercube. For total functions $f$, it…

Computational Complexity · Computer Science 2025-04-16 Vishnu Iyer , Siddhartha Jain , Robin Kothari , Matt Kovacs-Deak , Vinayak M. Kumar , Luke Schaeffer , Daochen Wang , Michael Whitmeyer

There is a one-to-one correspondence between geometric lattices and the intersection lattices of arrangements of homotopy spheres. When the arrangements are essential and fully partitioned, Zaslavsky's enumeration of the cells of the…

Combinatorics · Mathematics 2007-05-23 Edward Swartz

Given any order ideal $U$ consisting of color-squarefree monomials involving variables with $d$ colors, we associate to it a balanced $(d-1)$-dimensional simplicial complex $\Delta_{\mathrm{bal}}(U)$ that we call a balanced squeezed…

Combinatorics · Mathematics 2020-07-06 Martina Juhnke-Kubitzke , Uwe Nagel