English
Related papers

Related papers: On modular k-free sets

200 papers

It is known that complete graphs and complete multipartite graphs have modularity zero. We show that the least number of edges we may delete from the complete graph $K_n$ to obtain a graph with non-zero modularity is $\lfloor n/2\rfloor…

Combinatorics · Mathematics 2023-12-21 Colin McDiarmid , Fiona Skerman

Let $k$ be a commutative ring and $A$ a commutative $k$-algebra. Given a positive integer $m$, or $m=\infty$, we say that a $k$-linear derivation $\delta$ of $A$ is $m$-integrable if it extends up to a Hasse--Schmidt derivation…

Algebraic Geometry · Mathematics 2012-03-23 Luis Narváez-Macarro

Let $K$ be a global function field together with a place $\infty$, and $A$ the subring of functions regular outside $\infty$. In this paper we present an effective method to evaluate the (locally free) class number of an arbitrary…

Number Theory · Mathematics 2012-08-29 Fu-Tsun Wei , Chia-Fu Yu

Let $r_k(n)$ denote the maximum cardinality of a set $A \subset \{1,2, \dots, n \}$ such that $A$ does not contain a $k$-term arithmetic progression. In this paper, we give a method of constructing such a set and prove the lower bound…

Combinatorics · Mathematics 2017-11-21 Vladislav Taranchuk

In this paper, we establish some criteria to detect the presence of the maximal ideal $(x_1, \ldots, x_n)$ in the set of associated primes of powers of monomial ideals in the polynomial ring $K[x_1, \ldots, x_n]$. Furthermore, for each of…

Commutative Algebra · Mathematics 2026-05-25 Mehrdad Nasernejad , Jonathan Toledo

Maximizing submodular functions has been increasingly used in many applications of machine learning, such as data summarization, recommendation systems, and feature selection. Moreover, there has been a growing interest in both submodular…

Data Structures and Algorithms · Computer Science 2023-11-08 Kiarash Banihashem , Leyla Biabani , Samira Goudarzi , MohammadTaghi Hajiaghayi , Peyman Jabbarzade , Morteza Monemizadeh

Let $G$ be the adjoint group of a real simple Lie algebra $\mathfrak{g}_0$ equal either $\mathfrak{s}\mathfrak{u}(n,1)$ or $\mathfrak{s}\mathfrak{o}(n,1),$ $K$ its maximal compact subgroup, ${\cal U}(\mathfrak{g})$ the universal enveloping…

Representation Theory · Mathematics 2016-11-24 Hrvoje Kraljević

Maximizing monotone submodular functions under cardinality constraints is a classic optimization task with several applications in data mining and machine learning. In this paper we study this problem in a dynamic environment with…

Data Structures and Algorithms · Computer Science 2024-05-31 Paul Dütting , Federico Fusco , Silvio Lattanzi , Ashkan Norouzi-Fard , Morteza Zadimoghaddam

For all $n > k \ge 1$, we give formulas for the nullity $N(n,k)$ of the $n \times n$ skew-symmetric Toeplitz band matrix whose first $k$ superdiagonals have all entries $1$ and whose remaining superdiagonals have all entries $0$. This is…

Combinatorics · Mathematics 2020-02-10 Ron Evans , John Greene , Mark Van Veen

Let $K$ be a finite extension of $\mathbb{Q}$ and $\mathcal{O}_K$ be its ring of integers. Let $\mathfrak{B}$ be a primitive collection of ideals in $\mathcal{O}_K$. We show that any $\mathfrak{B}$-free system is essentially minimal.…

Dynamical Systems · Mathematics 2022-07-13 Aurelia Dymek , Stanisław Kasjan , Joanna Kułaga-Przymus

In this paper, we propose a novel framework that converts streaming algorithms for monotone submodular maximization into streaming algorithms for non-monotone submodular maximization. This reduction readily leads to the currently tightest…

Data Structures and Algorithms · Computer Science 2020-02-11 Ran Haba , Ehsan Kazemi , Moran Feldman , Amin Karbasi

Let $K$ denote prefix-free Kolmogorov Complexity, and $K^A$ denote it relative to an oracle $A$. We show that for any $n$, $K^{\emptyset^{(n)}}$ is definable purely in terms of the unrelativized notion $K$. It was already known that…

Logic · Mathematics 2022-08-08 Rodney Downey , Lu Liu , Keng Meng Ng , Daniel Turetsky

A finite abelian group $G$ of cardinality $n$ is said to be of type III if every prime divisor of $n$ is congruent to 1 modulo 3. We obtain a classification theorem for sum-free subsets of largest possible cardinality in a finite abelian…

Number Theory · Mathematics 2016-06-03 R. Balasubramanian , Gyan Prakash , D. S. Ramana

For positive integers $n\geq k\geq t$, a collection $ \mathcal{B} $ of $k$-subsets of an $n$-set $ X $ is called a $t$-packing if every $t$-subset of $ X $ appears in at most one set in $\mathcal{B}$. In this paper, we give some upper and…

Combinatorics · Mathematics 2019-05-28 Ramin Javadi , Ehsan Poorhadi , Farshad Fallah

The N cardinality k ideals of any w-element poset (w, k variable) can be enumerated in time O(Nw^3). The corresponding bound for k-element subtrees of a w-element tree is O(Nw^5). An algorithm is described that by the use of wildcards…

Combinatorics · Mathematics 2017-03-01 Marcel Wild

In 1992, following earlier conjectures of Lichtman and Makar-Limanov, Klein conjectured that a noncommutative domain must contain a free, multiplicative, noncyclic subsemigroup. He verified the conjecture when the center is uncountable. In…

Rings and Algebras · Mathematics 2019-04-08 Edward S. Letzter

We consider the classical problem of determining the largest possible cardinality of a minimal presentation of a numerical monoid with given embedding dimension and multiplicity. Very few values of this cardinality are known. In addressing…

Combinatorics · Mathematics 2025-05-14 Alessio Moscariello , Alessio Sammartano

Let $K$ be an algebraically closed field of characteristic zero, $A= K[x_1, \dots, x_n]$ the polynomial ring in $n$ variables, and let $W_n(K)$ be the Lie algebra of all $K$-derivations of $A.$ This Lie algebra also is the free $A$-module…

Rings and Algebras · Mathematics 2026-05-25 Y. Chapovskyi , A. Petravchuk , O. Tyshchenko

An old problem of Moser asks: how large of a union-free subfamily does every family of m sets have? A family of sets is called union-free if there are no three distinct sets in the family such that the union of two of the sets is equal to…

Combinatorics · Mathematics 2011-03-17 Jacob Fox , Choongbum Lee , Benny Sudakov

Given a natural number $k\ge 2$, we consider the $k$-submodular cover problem ($k$-SC). The objective is to find a minimum cost subset of a ground set $\mathcal{X}$ subject to the value of a $k$-submodular utility function being at least a…

Data Structures and Algorithms · Computer Science 2023-12-07 Wenqi Wang , Gregory Gutin , Yaping Mao , Donglei Du , Xiaoyan Zhang
‹ Prev 1 8 9 10 Next ›